結果
問題 | No.800 四平方定理 |
ユーザー | McGregorsh |
提出日時 | 2023-07-06 22:42:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,803 ms / 2,000 ms |
コード長 | 1,630 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 86,988 KB |
実行使用メモリ | 299,232 KB |
最終ジャッジ日時 | 2023-09-27 23:46:43 |
合計ジャッジ時間 | 27,050 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 219 ms
93,580 KB |
testcase_01 | AC | 230 ms
98,100 KB |
testcase_02 | AC | 221 ms
95,400 KB |
testcase_03 | AC | 221 ms
96,552 KB |
testcase_04 | AC | 221 ms
95,000 KB |
testcase_05 | AC | 230 ms
96,160 KB |
testcase_06 | AC | 231 ms
99,972 KB |
testcase_07 | AC | 228 ms
98,336 KB |
testcase_08 | AC | 226 ms
99,620 KB |
testcase_09 | AC | 227 ms
98,736 KB |
testcase_10 | AC | 770 ms
259,692 KB |
testcase_11 | AC | 798 ms
244,976 KB |
testcase_12 | AC | 818 ms
260,764 KB |
testcase_13 | AC | 779 ms
260,360 KB |
testcase_14 | AC | 817 ms
244,632 KB |
testcase_15 | AC | 842 ms
244,736 KB |
testcase_16 | AC | 795 ms
244,940 KB |
testcase_17 | AC | 822 ms
244,888 KB |
testcase_18 | AC | 869 ms
244,736 KB |
testcase_19 | AC | 841 ms
244,804 KB |
testcase_20 | AC | 197 ms
89,960 KB |
testcase_21 | AC | 209 ms
89,956 KB |
testcase_22 | AC | 859 ms
244,724 KB |
testcase_23 | AC | 1,619 ms
297,752 KB |
testcase_24 | AC | 1,553 ms
299,232 KB |
testcase_25 | AC | 1,672 ms
298,876 KB |
testcase_26 | AC | 199 ms
89,928 KB |
testcase_27 | AC | 208 ms
89,848 KB |
testcase_28 | AC | 1,468 ms
298,752 KB |
testcase_29 | AC | 1,542 ms
298,936 KB |
testcase_30 | AC | 1,803 ms
296,580 KB |
testcase_31 | AC | 1,375 ms
259,304 KB |
testcase_32 | AC | 1,504 ms
297,500 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() nums = [] for i in range(1, N+1): a = i ** 2 for j in range(1, N+1): b = j ** 2 nums.append(a+b) Cn = Counter(nums) 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()