結果
問題 | No.1664 Unstable f(n) |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 23:30:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 240 ms / 2,000 ms |
コード長 | 1,784 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 87,080 KB |
実行使用メモリ | 93,336 KB |
最終ジャッジ日時 | 2023-08-23 15:22:02 |
合計ジャッジ時間 | 12,290 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 231 ms
93,024 KB |
testcase_01 | AC | 237 ms
93,096 KB |
testcase_02 | AC | 236 ms
93,220 KB |
testcase_03 | AC | 225 ms
92,364 KB |
testcase_04 | AC | 224 ms
92,452 KB |
testcase_05 | AC | 221 ms
92,476 KB |
testcase_06 | AC | 226 ms
92,476 KB |
testcase_07 | AC | 226 ms
92,508 KB |
testcase_08 | AC | 234 ms
93,032 KB |
testcase_09 | AC | 231 ms
93,008 KB |
testcase_10 | AC | 232 ms
93,260 KB |
testcase_11 | AC | 232 ms
93,092 KB |
testcase_12 | AC | 228 ms
93,044 KB |
testcase_13 | AC | 231 ms
93,140 KB |
testcase_14 | AC | 237 ms
93,172 KB |
testcase_15 | AC | 235 ms
93,196 KB |
testcase_16 | AC | 230 ms
93,032 KB |
testcase_17 | AC | 238 ms
93,228 KB |
testcase_18 | AC | 235 ms
92,988 KB |
testcase_19 | AC | 238 ms
93,072 KB |
testcase_20 | AC | 240 ms
93,152 KB |
testcase_21 | AC | 234 ms
93,040 KB |
testcase_22 | AC | 235 ms
93,160 KB |
testcase_23 | AC | 240 ms
93,012 KB |
testcase_24 | AC | 235 ms
93,228 KB |
testcase_25 | AC | 235 ms
93,068 KB |
testcase_26 | AC | 234 ms
93,156 KB |
testcase_27 | AC | 233 ms
93,120 KB |
testcase_28 | AC | 234 ms
93,156 KB |
testcase_29 | AC | 239 ms
93,092 KB |
testcase_30 | AC | 238 ms
93,080 KB |
testcase_31 | AC | 233 ms
92,984 KB |
testcase_32 | AC | 235 ms
93,008 KB |
testcase_33 | AC | 239 ms
93,008 KB |
testcase_34 | AC | 240 ms
92,992 KB |
testcase_35 | AC | 236 ms
92,976 KB |
testcase_36 | AC | 238 ms
93,336 KB |
testcase_37 | AC | 237 ms
93,192 KB |
testcase_38 | AC | 234 ms
92,932 KB |
testcase_39 | AC | 233 ms
92,976 KB |
testcase_40 | AC | 236 ms
93,224 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(): N = int(input()) if N <= 5: print(N) exit() ans = INF for i in range(70): top = 10 ** 18 under = 0 while top - under > 1: mid = (top + under) // 2 p = mid ** i if p > N: top = mid else: under = mid amari = N - (under ** i) score = amari + i + under #print(i, score) ans = min(ans, score) print(ans) if __name__ == '__main__': main()