結果

問題 No.1593 Perfect Distance
ユーザー McGregorshMcGregorsh
提出日時 2023-05-10 14:30:00
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 229 ms / 2,000 ms
コード長 1,603 bytes
コンパイル時間 558 ms
コンパイル使用メモリ 82,268 KB
実行使用メモリ 154,684 KB
最終ジャッジ日時 2024-11-26 19:57:15
合計ジャッジ時間 5,897 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 225 ms
153,920 KB
testcase_01 AC 229 ms
153,960 KB
testcase_02 AC 223 ms
154,256 KB
testcase_03 AC 221 ms
154,684 KB
testcase_04 AC 225 ms
154,460 KB
testcase_05 AC 226 ms
154,352 KB
testcase_06 AC 226 ms
154,372 KB
testcase_07 AC 225 ms
154,208 KB
testcase_08 AC 224 ms
154,172 KB
testcase_09 AC 220 ms
154,120 KB
testcase_10 AC 218 ms
154,180 KB
testcase_11 AC 220 ms
153,908 KB
testcase_12 AC 228 ms
154,532 KB
testcase_13 AC 229 ms
154,536 KB
testcase_14 AC 222 ms
154,176 KB
testcase_15 AC 225 ms
154,244 KB
testcase_16 AC 223 ms
154,448 KB
testcase_17 AC 224 ms
154,160 KB
testcase_18 AC 225 ms
154,200 KB
testcase_19 AC 222 ms
154,340 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys, re
from fractions import Fraction
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
from decimal import Decimal, getcontext, ROUND_HALF_UP
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
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
def main():
N = int(input())
N = N ** 2
juge = defaultdict(int)
for i in range(1, 200100):
juge[i ** 2] = 1
ans = 0
for i in range(1, 200100):
p = i ** 2
x = N - p
if juge[x] == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0