結果
問題 | No.897 compαctree |
ユーザー | McGregorsh |
提出日時 | 2023-05-07 22:32:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 244 ms / 2,000 ms |
コード長 | 1,618 bytes |
コンパイル時間 | 658 ms |
コンパイル使用メモリ | 86,912 KB |
実行使用メモリ | 92,348 KB |
最終ジャッジ日時 | 2023-08-16 09:00:10 |
合計ジャッジ時間 | 5,100 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
91,888 KB |
testcase_01 | AC | 242 ms
91,936 KB |
testcase_02 | AC | 242 ms
91,848 KB |
testcase_03 | AC | 242 ms
91,912 KB |
testcase_04 | AC | 235 ms
92,052 KB |
testcase_05 | AC | 241 ms
91,932 KB |
testcase_06 | AC | 243 ms
91,836 KB |
testcase_07 | AC | 244 ms
92,028 KB |
testcase_08 | AC | 242 ms
92,348 KB |
testcase_09 | AC | 242 ms
91,832 KB |
testcase_10 | AC | 244 ms
92,176 KB |
testcase_11 | AC | 241 ms
92,160 KB |
testcase_12 | AC | 241 ms
92,260 KB |
testcase_13 | AC | 243 ms
92,268 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()) for i in range(N): a, b = i_map() if b == 1: print(a - 1) continue cou = 1 now = 1 cost = 0 while cou < a: now *= b cou += now cost += 1 print(cost) if __name__ == '__main__': main()