結果
問題 | No.1176 少ない質問 |
ユーザー | cozy_sauna |
提出日時 | 2021-10-21 14:18:05 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,848 bytes |
コンパイル時間 | 210 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 77,180 KB |
最終ジャッジ日時 | 2023-12-18 02:50:32 |
合計ジャッジ時間 | 17,803 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 874 ms
77,040 KB |
testcase_01 | AC | 652 ms
77,040 KB |
testcase_02 | TLE | - |
testcase_03 | AC | 956 ms
77,040 KB |
testcase_04 | AC | 748 ms
77,040 KB |
testcase_05 | AC | 904 ms
77,040 KB |
testcase_06 | AC | 686 ms
77,040 KB |
testcase_07 | AC | 721 ms
77,176 KB |
testcase_08 | AC | 717 ms
77,040 KB |
testcase_09 | AC | 797 ms
77,176 KB |
testcase_10 | AC | 537 ms
77,176 KB |
testcase_11 | AC | 411 ms
77,176 KB |
testcase_12 | AC | 769 ms
77,040 KB |
testcase_13 | AC | 446 ms
77,176 KB |
testcase_14 | TLE | - |
testcase_15 | AC | 802 ms
77,176 KB |
testcase_16 | AC | 832 ms
77,040 KB |
testcase_17 | TLE | - |
testcase_18 | AC | 507 ms
77,180 KB |
testcase_19 | AC | 880 ms
77,040 KB |
testcase_20 | AC | 68 ms
66,764 KB |
ソースコード
from sys import setrecursionlimit, stdin from collections import defaultdict, deque from itertools import permutations, combinations, product from functools import lru_cache from random import sample, choice, randint, random from heapq import heappush, heappop from math import factorial, gcd, exp from copy import copy, deepcopy from time import time setrecursionlimit(10 ** 6) readline = stdin.readline # @lru_cache(maxsize=None) INF = 10 ** 18 MOD = 1000000007 # MOD = 998244353 DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)] def I(): return int(readline()) def S(): return readline()[:-1] def LI(): return list(map(int, readline().split())) def SPI(): return map(int, readline().split()) def SPII(): return map(lambda x: int(x)-1, readline().split()) def FIE(x): return [readline()[:-1] for _ in [0] * x] def NODE(x): return [[] for _ in [0] * x] def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])] def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx] def imax(A, idx=-1, m=-(1<<18)): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m < a] return idx def imin(A, idx=-1, m=1<<18): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m > a] return idx def cmin(dp, i, x): if x < dp[i]: dp[i] = x def cmax(dp, i, x): if x > dp[i]: dp[i] = x def gen(x, *args): ret = [x] * args[-1] for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e] return ret def puts(E): for e in E: print(e) def pprint(E): print() puts(E) #################################################################### A = I() # N ** M >= A limit = 10 ** 6 ans = INF for N in range(2, limit+1): for M in range(1, limit+1): e = N ** M if e >= A: ans = min(ans, N*M) break print(ans)