結果
問題 | No.1664 Unstable f(n) |
ユーザー | McGregorsh |
提出日時 | 2022-07-24 14:31:39 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,947 bytes |
コンパイル時間 | 296 ms |
コンパイル使用メモリ | 86,752 KB |
実行使用メモリ | 93,464 KB |
最終ジャッジ日時 | 2023-09-20 13:42:38 |
合計ジャッジ時間 | 13,472 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 248 ms
93,116 KB |
testcase_01 | AC | 250 ms
93,376 KB |
testcase_02 | AC | 250 ms
93,236 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 249 ms
93,312 KB |
testcase_07 | AC | 253 ms
93,144 KB |
testcase_08 | AC | 250 ms
93,152 KB |
testcase_09 | AC | 248 ms
93,312 KB |
testcase_10 | AC | 252 ms
93,080 KB |
testcase_11 | AC | 252 ms
93,236 KB |
testcase_12 | AC | 255 ms
92,948 KB |
testcase_13 | AC | 254 ms
93,352 KB |
testcase_14 | AC | 252 ms
93,200 KB |
testcase_15 | AC | 259 ms
93,208 KB |
testcase_16 | AC | 255 ms
93,064 KB |
testcase_17 | AC | 263 ms
93,248 KB |
testcase_18 | AC | 259 ms
93,376 KB |
testcase_19 | AC | 261 ms
93,424 KB |
testcase_20 | AC | 259 ms
93,352 KB |
testcase_21 | AC | 251 ms
93,112 KB |
testcase_22 | AC | 250 ms
93,184 KB |
testcase_23 | AC | 255 ms
93,232 KB |
testcase_24 | AC | 259 ms
93,316 KB |
testcase_25 | AC | 258 ms
93,120 KB |
testcase_26 | AC | 258 ms
93,368 KB |
testcase_27 | AC | 257 ms
93,384 KB |
testcase_28 | AC | 259 ms
93,224 KB |
testcase_29 | AC | 248 ms
93,204 KB |
testcase_30 | AC | 251 ms
92,956 KB |
testcase_31 | AC | 252 ms
93,464 KB |
testcase_32 | AC | 257 ms
93,076 KB |
testcase_33 | AC | 255 ms
93,192 KB |
testcase_34 | AC | 253 ms
93,108 KB |
testcase_35 | AC | 255 ms
93,420 KB |
testcase_36 | AC | 251 ms
93,336 KB |
testcase_37 | AC | 260 ms
93,344 KB |
testcase_38 | AC | 258 ms
93,208 KB |
testcase_39 | AC | 253 ms
93,420 KB |
testcase_40 | AC | 252 ms
93,112 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 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()