結果
問題 | No.1585 Cubic Number |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 14:00:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 485 ms / 1,000 ms |
コード長 | 1,510 bytes |
コンパイル時間 | 280 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 259,576 KB |
最終ジャッジ日時 | 2023-08-17 19:39:00 |
合計ジャッジ時間 | 17,268 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 473 ms
259,464 KB |
testcase_01 | AC | 476 ms
259,344 KB |
testcase_02 | AC | 476 ms
259,300 KB |
testcase_03 | AC | 479 ms
259,424 KB |
testcase_04 | AC | 485 ms
259,344 KB |
testcase_05 | AC | 482 ms
259,476 KB |
testcase_06 | AC | 483 ms
259,480 KB |
testcase_07 | AC | 467 ms
259,412 KB |
testcase_08 | AC | 480 ms
259,284 KB |
testcase_09 | AC | 477 ms
259,444 KB |
testcase_10 | AC | 475 ms
259,408 KB |
testcase_11 | AC | 475 ms
259,548 KB |
testcase_12 | AC | 471 ms
259,412 KB |
testcase_13 | AC | 483 ms
259,356 KB |
testcase_14 | AC | 475 ms
259,184 KB |
testcase_15 | AC | 469 ms
259,272 KB |
testcase_16 | AC | 473 ms
259,212 KB |
testcase_17 | AC | 474 ms
259,312 KB |
testcase_18 | AC | 480 ms
259,204 KB |
testcase_19 | AC | 477 ms
259,304 KB |
testcase_20 | AC | 461 ms
259,364 KB |
testcase_21 | AC | 473 ms
259,404 KB |
testcase_22 | AC | 480 ms
259,396 KB |
testcase_23 | AC | 480 ms
259,512 KB |
testcase_24 | AC | 472 ms
259,236 KB |
testcase_25 | AC | 471 ms
259,560 KB |
testcase_26 | AC | 474 ms
259,576 KB |
testcase_27 | AC | 480 ms
259,412 KB |
testcase_28 | AC | 475 ms
259,492 KB |
testcase_29 | AC | 480 ms
259,524 KB |
testcase_30 | AC | 480 ms
259,468 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, 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(): juge = defaultdict(int) for i in range(1, 1001000): juge[i ** 3] = 1 if juge[int(input())] == 1: print('Yes') else: print('No') if __name__ == '__main__': main()