結果
問題 | No.800 四平方定理 |
ユーザー | McGregorsh |
提出日時 | 2023-07-06 22:45:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 377 ms / 2,000 ms |
コード長 | 1,620 bytes |
コンパイル時間 | 743 ms |
コンパイル使用メモリ | 86,640 KB |
実行使用メモリ | 169,340 KB |
最終ジャッジ日時 | 2023-09-27 23:50:10 |
合計ジャッジ時間 | 10,950 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
168,452 KB |
testcase_01 | AC | 237 ms
168,688 KB |
testcase_02 | AC | 236 ms
168,992 KB |
testcase_03 | AC | 237 ms
169,072 KB |
testcase_04 | AC | 235 ms
169,072 KB |
testcase_05 | AC | 230 ms
168,680 KB |
testcase_06 | AC | 230 ms
169,048 KB |
testcase_07 | AC | 237 ms
168,720 KB |
testcase_08 | AC | 238 ms
168,796 KB |
testcase_09 | AC | 230 ms
168,984 KB |
testcase_10 | AC | 271 ms
169,044 KB |
testcase_11 | AC | 286 ms
168,688 KB |
testcase_12 | AC | 282 ms
168,828 KB |
testcase_13 | AC | 266 ms
168,856 KB |
testcase_14 | AC | 268 ms
168,812 KB |
testcase_15 | AC | 277 ms
168,860 KB |
testcase_16 | AC | 275 ms
168,964 KB |
testcase_17 | AC | 276 ms
168,880 KB |
testcase_18 | AC | 288 ms
168,852 KB |
testcase_19 | AC | 289 ms
169,068 KB |
testcase_20 | AC | 235 ms
167,932 KB |
testcase_21 | AC | 232 ms
168,060 KB |
testcase_22 | AC | 286 ms
168,708 KB |
testcase_23 | AC | 334 ms
168,904 KB |
testcase_24 | AC | 319 ms
168,836 KB |
testcase_25 | AC | 333 ms
168,876 KB |
testcase_26 | AC | 233 ms
167,780 KB |
testcase_27 | AC | 228 ms
168,148 KB |
testcase_28 | AC | 318 ms
169,000 KB |
testcase_29 | AC | 316 ms
168,972 KB |
testcase_30 | AC | 377 ms
169,340 KB |
testcase_31 | AC | 311 ms
168,884 KB |
testcase_32 | AC | 314 ms
168,860 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, D = i_map() Cn = [0] * (10 ** 7) for i in range(1, N+1): a = i ** 2 for j in range(1, N+1): b = j ** 2 Cn[a+b] += 1 ans = 0 for w in range(1, N+1): a = w ** 2 for z in range(1, N+1): b = z ** 2 p = a - b + D if p < 0: break ans += Cn[p] print(ans) if __name__ == '__main__': main()