結果
問題 | No.1664 Unstable f(n) |
ユーザー | McGregorsh |
提出日時 | 2022-07-24 14:31:39 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,947 bytes |
コンパイル時間 | 152 ms |
コンパイル使用メモリ | 82,120 KB |
実行使用メモリ | 90,368 KB |
最終ジャッジ日時 | 2024-07-06 08:58:50 |
合計ジャッジ時間 | 6,943 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
89,924 KB |
testcase_01 | AC | 130 ms
90,112 KB |
testcase_02 | AC | 128 ms
90,236 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 129 ms
89,812 KB |
testcase_07 | AC | 128 ms
89,856 KB |
testcase_08 | AC | 128 ms
89,740 KB |
testcase_09 | AC | 130 ms
90,112 KB |
testcase_10 | AC | 128 ms
89,856 KB |
testcase_11 | AC | 129 ms
89,984 KB |
testcase_12 | AC | 131 ms
89,984 KB |
testcase_13 | AC | 131 ms
89,984 KB |
testcase_14 | AC | 131 ms
90,240 KB |
testcase_15 | AC | 136 ms
90,112 KB |
testcase_16 | AC | 130 ms
89,800 KB |
testcase_17 | AC | 130 ms
90,112 KB |
testcase_18 | AC | 129 ms
89,952 KB |
testcase_19 | AC | 130 ms
89,984 KB |
testcase_20 | AC | 131 ms
89,984 KB |
testcase_21 | AC | 129 ms
90,112 KB |
testcase_22 | AC | 130 ms
89,836 KB |
testcase_23 | AC | 128 ms
90,112 KB |
testcase_24 | AC | 130 ms
89,984 KB |
testcase_25 | AC | 129 ms
89,984 KB |
testcase_26 | AC | 129 ms
89,740 KB |
testcase_27 | AC | 128 ms
89,856 KB |
testcase_28 | AC | 129 ms
90,368 KB |
testcase_29 | AC | 129 ms
89,856 KB |
testcase_30 | AC | 131 ms
89,728 KB |
testcase_31 | AC | 132 ms
89,856 KB |
testcase_32 | AC | 130 ms
89,796 KB |
testcase_33 | AC | 135 ms
89,856 KB |
testcase_34 | AC | 129 ms
89,888 KB |
testcase_35 | AC | 131 ms
90,368 KB |
testcase_36 | AC | 128 ms
89,832 KB |
testcase_37 | AC | 131 ms
89,984 KB |
testcase_38 | AC | 135 ms
90,112 KB |
testcase_39 | AC | 130 ms
89,856 KB |
testcase_40 | AC | 131 ms
89,944 KB |
ソースコード
import sys, refrom fractions import Fractionfrom math import ceil, floor, sqrt, pi, factorial, gcdfrom copy import deepcopyfrom collections import Counter, deque, defaultdictfrom heapq import heapify, heappop, heappushfrom itertools import accumulate, product, combinations, combinations_with_replacement, permutationsfrom bisect import bisect, bisect_left, bisect_rightfrom functools import reducefrom decimal import Decimal, getcontextdef 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 ddef rotate(table):n_fild = []for x in zip(*table[::-1]):n_fild.append(x)return n_fildsys.setrecursionlimit(10 ** 7)INF = float('inf')MOD = 10 ** 9 + 7MOD2 = 998244353###関数コピーしたか?###def main():n = int(input())ans = INFfor i in range(70):top = 10 ** 10under = 0while top - under > 1:mid = (top + under) // 2score = midjuge = Truefor j in range(i-1):score *= midif score > n:juge = Falsebreakif juge:under = midelse:top = mid#print(under)amari = n - (under**i)cost = i + under + amarians = min(ans, cost)#print(i, under, amari)print(ans)if __name__ == '__main__':main()