結果
問題 | No.1664 Unstable f(n) |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 23:18:50 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,715 bytes |
コンパイル時間 | 277 ms |
コンパイル使用メモリ | 87,036 KB |
実行使用メモリ | 93,296 KB |
最終ジャッジ日時 | 2023-08-23 15:16:27 |
合計ジャッジ時間 | 12,089 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
93,248 KB |
testcase_01 | AC | 242 ms
93,204 KB |
testcase_02 | AC | 241 ms
93,296 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 241 ms
93,012 KB |
testcase_07 | AC | 244 ms
93,160 KB |
testcase_08 | AC | 241 ms
93,084 KB |
testcase_09 | AC | 245 ms
93,168 KB |
testcase_10 | AC | 245 ms
93,036 KB |
testcase_11 | AC | 243 ms
93,016 KB |
testcase_12 | AC | 242 ms
93,176 KB |
testcase_13 | AC | 241 ms
93,172 KB |
testcase_14 | AC | 240 ms
93,044 KB |
testcase_15 | AC | 238 ms
93,168 KB |
testcase_16 | AC | 235 ms
93,080 KB |
testcase_17 | AC | 237 ms
93,104 KB |
testcase_18 | AC | 241 ms
93,060 KB |
testcase_19 | AC | 234 ms
93,280 KB |
testcase_20 | AC | 237 ms
93,288 KB |
testcase_21 | AC | 239 ms
93,208 KB |
testcase_22 | AC | 238 ms
92,996 KB |
testcase_23 | AC | 240 ms
93,164 KB |
testcase_24 | AC | 237 ms
93,224 KB |
testcase_25 | AC | 239 ms
93,060 KB |
testcase_26 | AC | 232 ms
92,984 KB |
testcase_27 | AC | 233 ms
93,036 KB |
testcase_28 | AC | 233 ms
93,136 KB |
testcase_29 | AC | 238 ms
93,080 KB |
testcase_30 | AC | 237 ms
93,164 KB |
testcase_31 | AC | 238 ms
93,244 KB |
testcase_32 | AC | 239 ms
93,052 KB |
testcase_33 | AC | 235 ms
93,036 KB |
testcase_34 | AC | 236 ms
93,224 KB |
testcase_35 | AC | 238 ms
93,012 KB |
testcase_36 | AC | 235 ms
93,168 KB |
testcase_37 | AC | 240 ms
93,000 KB |
testcase_38 | AC | 241 ms
93,280 KB |
testcase_39 | AC | 239 ms
93,168 KB |
testcase_40 | AC | 237 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, 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()) 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 ans = min(ans, score) print(ans) if __name__ == '__main__': main()