結果
問題 | No.1664 Unstable f(n) |
ユーザー | McGregorsh |
提出日時 | 2022-07-24 14:40:31 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,023 bytes |
コンパイル時間 | 446 ms |
コンパイル使用メモリ | 87,216 KB |
実行使用メモリ | 93,668 KB |
最終ジャッジ日時 | 2023-09-20 13:53:39 |
合計ジャッジ時間 | 12,818 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 257 ms
93,292 KB |
testcase_01 | AC | 250 ms
93,464 KB |
testcase_02 | AC | 250 ms
93,408 KB |
testcase_03 | AC | 249 ms
93,460 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 247 ms
93,336 KB |
testcase_07 | AC | 248 ms
93,328 KB |
testcase_08 | AC | 252 ms
93,444 KB |
testcase_09 | AC | 250 ms
93,228 KB |
testcase_10 | AC | 248 ms
93,344 KB |
testcase_11 | AC | 251 ms
93,472 KB |
testcase_12 | AC | 254 ms
93,596 KB |
testcase_13 | AC | 248 ms
93,480 KB |
testcase_14 | AC | 251 ms
93,260 KB |
testcase_15 | AC | 254 ms
93,480 KB |
testcase_16 | AC | 253 ms
93,432 KB |
testcase_17 | AC | 262 ms
93,548 KB |
testcase_18 | AC | 253 ms
93,328 KB |
testcase_19 | AC | 255 ms
93,360 KB |
testcase_20 | AC | 265 ms
93,668 KB |
testcase_21 | AC | 254 ms
93,348 KB |
testcase_22 | AC | 258 ms
93,460 KB |
testcase_23 | AC | 252 ms
93,508 KB |
testcase_24 | AC | 253 ms
93,384 KB |
testcase_25 | AC | 248 ms
93,452 KB |
testcase_26 | AC | 250 ms
93,276 KB |
testcase_27 | AC | 250 ms
93,384 KB |
testcase_28 | AC | 249 ms
93,588 KB |
testcase_29 | AC | 249 ms
93,440 KB |
testcase_30 | AC | 250 ms
93,320 KB |
testcase_31 | AC | 255 ms
93,340 KB |
testcase_32 | AC | 253 ms
93,156 KB |
testcase_33 | AC | 249 ms
93,536 KB |
testcase_34 | AC | 252 ms
93,392 KB |
testcase_35 | AC | 277 ms
93,576 KB |
testcase_36 | AC | 251 ms
93,456 KB |
testcase_37 | AC | 248 ms
93,536 KB |
testcase_38 | AC | 248 ms
93,348 KB |
testcase_39 | AC | 247 ms
93,500 KB |
testcase_40 | AC | 253 ms
93,448 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 = int(input()) ans = INF for i in range(70): top = 10 ** 10 under = 0 while top - under > 1: mid = (top + under) // 2 score = mid if score > n: juge = False else: juge = True for j in range(i-1): score *= mid if score > n: juge = False break if juge: under = mid else: top = mid #print(under) amari = n - (under**i) cost = i + under + amari ans = min(ans, cost) #print(i, under, amari) print(ans) if __name__ == '__main__': main()