結果
問題 | No.1664 Unstable f(n) |
ユーザー | McGregorsh |
提出日時 | 2022-07-24 14:33:19 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,947 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 86,752 KB |
実行使用メモリ | 93,608 KB |
最終ジャッジ日時 | 2023-09-20 13:44:49 |
合計ジャッジ時間 | 13,458 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 256 ms
93,032 KB |
testcase_01 | AC | 250 ms
92,976 KB |
testcase_02 | AC | 249 ms
93,432 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 257 ms
92,860 KB |
testcase_07 | AC | 253 ms
93,232 KB |
testcase_08 | AC | 249 ms
93,096 KB |
testcase_09 | AC | 247 ms
93,332 KB |
testcase_10 | AC | 248 ms
93,340 KB |
testcase_11 | AC | 261 ms
93,172 KB |
testcase_12 | AC | 256 ms
93,516 KB |
testcase_13 | AC | 252 ms
93,120 KB |
testcase_14 | AC | 253 ms
93,520 KB |
testcase_15 | AC | 256 ms
93,440 KB |
testcase_16 | AC | 257 ms
93,196 KB |
testcase_17 | AC | 254 ms
93,444 KB |
testcase_18 | AC | 258 ms
93,060 KB |
testcase_19 | AC | 255 ms
93,212 KB |
testcase_20 | AC | 260 ms
93,252 KB |
testcase_21 | AC | 256 ms
93,372 KB |
testcase_22 | AC | 256 ms
92,976 KB |
testcase_23 | AC | 254 ms
92,988 KB |
testcase_24 | AC | 252 ms
93,288 KB |
testcase_25 | AC | 254 ms
93,368 KB |
testcase_26 | AC | 253 ms
93,376 KB |
testcase_27 | AC | 248 ms
93,420 KB |
testcase_28 | AC | 253 ms
93,164 KB |
testcase_29 | AC | 259 ms
93,228 KB |
testcase_30 | AC | 257 ms
93,296 KB |
testcase_31 | AC | 257 ms
93,260 KB |
testcase_32 | AC | 256 ms
93,348 KB |
testcase_33 | AC | 256 ms
93,308 KB |
testcase_34 | AC | 255 ms
93,304 KB |
testcase_35 | AC | 254 ms
93,304 KB |
testcase_36 | AC | 254 ms
93,292 KB |
testcase_37 | AC | 253 ms
93,608 KB |
testcase_38 | AC | 260 ms
93,136 KB |
testcase_39 | AC | 253 ms
92,960 KB |
testcase_40 | AC | 253 ms
93,284 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 ** 20 under = 0 while top - under > 1: mid = (top + under) // 2 score = mid 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()