結果
問題 | No.800 四平方定理 |
ユーザー | McGregorsh |
提出日時 | 2023-07-06 22:39:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,736 ms / 2,000 ms |
コード長 | 1,565 bytes |
コンパイル時間 | 315 ms |
コンパイル使用メモリ | 87,008 KB |
実行使用メモリ | 300,776 KB |
最終ジャッジ日時 | 2023-09-27 23:44:01 |
合計ジャッジ時間 | 28,280 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 219 ms
93,316 KB |
testcase_01 | AC | 231 ms
98,124 KB |
testcase_02 | AC | 223 ms
95,672 KB |
testcase_03 | AC | 226 ms
96,512 KB |
testcase_04 | AC | 225 ms
95,216 KB |
testcase_05 | AC | 225 ms
96,108 KB |
testcase_06 | AC | 230 ms
99,612 KB |
testcase_07 | AC | 234 ms
98,464 KB |
testcase_08 | AC | 238 ms
99,624 KB |
testcase_09 | AC | 235 ms
98,484 KB |
testcase_10 | AC | 811 ms
259,124 KB |
testcase_11 | AC | 863 ms
244,808 KB |
testcase_12 | AC | 855 ms
260,676 KB |
testcase_13 | AC | 822 ms
259,656 KB |
testcase_14 | AC | 898 ms
244,820 KB |
testcase_15 | AC | 941 ms
245,048 KB |
testcase_16 | AC | 951 ms
244,684 KB |
testcase_17 | AC | 957 ms
244,884 KB |
testcase_18 | AC | 928 ms
244,688 KB |
testcase_19 | AC | 913 ms
244,872 KB |
testcase_20 | AC | 209 ms
89,872 KB |
testcase_21 | AC | 211 ms
89,880 KB |
testcase_22 | AC | 928 ms
245,032 KB |
testcase_23 | AC | 1,715 ms
299,232 KB |
testcase_24 | AC | 1,639 ms
297,044 KB |
testcase_25 | AC | 1,736 ms
296,984 KB |
testcase_26 | AC | 208 ms
89,976 KB |
testcase_27 | AC | 208 ms
89,956 KB |
testcase_28 | AC | 1,648 ms
297,580 KB |
testcase_29 | AC | 1,614 ms
298,836 KB |
testcase_30 | AC | 1,629 ms
298,136 KB |
testcase_31 | AC | 1,469 ms
260,404 KB |
testcase_32 | AC | 1,654 ms
300,776 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): for z in range(1, N+1): p = w ** 2 - z ** 2 + D ans += Cn[p] print(ans) if __name__ == '__main__': main()