結果
問題 | No.1218 Something Like a Theorem |
ユーザー | McGregorsh |
提出日時 | 2022-07-13 15:49:43 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,779 bytes |
コンパイル時間 | 196 ms |
コンパイル使用メモリ | 82,228 KB |
実行使用メモリ | 90,648 KB |
最終ジャッジ日時 | 2024-06-24 20:25:56 |
合計ジャッジ時間 | 4,251 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 150 ms
89,264 KB |
testcase_01 | AC | 150 ms
89,768 KB |
testcase_02 | AC | 147 ms
89,620 KB |
testcase_03 | AC | 146 ms
89,732 KB |
testcase_04 | AC | 146 ms
89,580 KB |
testcase_05 | WA | - |
testcase_06 | AC | 147 ms
89,364 KB |
testcase_07 | AC | 152 ms
90,612 KB |
testcase_08 | AC | 150 ms
89,832 KB |
testcase_09 | AC | 159 ms
90,144 KB |
testcase_10 | AC | 151 ms
90,060 KB |
testcase_11 | AC | 146 ms
89,584 KB |
testcase_12 | AC | 146 ms
89,284 KB |
testcase_13 | AC | 146 ms
89,348 KB |
testcase_14 | AC | 143 ms
89,572 KB |
testcase_15 | AC | 145 ms
89,560 KB |
testcase_16 | AC | 146 ms
89,628 KB |
testcase_17 | AC | 147 ms
89,924 KB |
ソースコード
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 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, z = i_map() num = z ** n for i in range(1, 1010): point1 = i ** n if point1 > num: break for k in range(1, 1010): point2 = k ** n if point2 > num: break #print(point1, point2) if point1 + point2 == num: print('Yes') #print(point1, point2) exit() print('No') if __name__ == '__main__': main()