結果
問題 | No.1010 折って重ねて |
ユーザー | McGregorsh |
提出日時 | 2022-07-07 21:46:02 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,584 bytes |
コンパイル時間 | 357 ms |
コンパイル使用メモリ | 87,240 KB |
実行使用メモリ | 92,960 KB |
最終ジャッジ日時 | 2023-08-26 08:54:50 |
合計ジャッジ時間 | 11,966 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 213 ms
92,744 KB |
testcase_01 | AC | 207 ms
92,960 KB |
testcase_02 | AC | 208 ms
92,576 KB |
testcase_03 | AC | 211 ms
92,544 KB |
testcase_04 | AC | 208 ms
92,580 KB |
testcase_05 | AC | 204 ms
92,720 KB |
testcase_06 | AC | 213 ms
92,904 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 207 ms
92,608 KB |
testcase_11 | AC | 198 ms
92,764 KB |
testcase_12 | WA | - |
testcase_13 | AC | 209 ms
92,900 KB |
testcase_14 | AC | 210 ms
92,780 KB |
testcase_15 | AC | 216 ms
92,736 KB |
testcase_16 | AC | 214 ms
92,632 KB |
testcase_17 | AC | 209 ms
92,680 KB |
testcase_18 | AC | 206 ms
92,880 KB |
testcase_19 | WA | - |
testcase_20 | AC | 220 ms
92,624 KB |
testcase_21 | AC | 217 ms
92,680 KB |
testcase_22 | WA | - |
testcase_23 | AC | 210 ms
92,784 KB |
testcase_24 | AC | 206 ms
92,568 KB |
testcase_25 | AC | 216 ms
92,788 KB |
testcase_26 | WA | - |
testcase_27 | AC | 201 ms
92,908 KB |
testcase_28 | AC | 202 ms
92,692 KB |
testcase_29 | AC | 202 ms
92,612 KB |
testcase_30 | AC | 204 ms
92,736 KB |
testcase_31 | AC | 207 ms
92,900 KB |
testcase_32 | WA | - |
testcase_33 | AC | 206 ms
92,756 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 207 ms
92,912 KB |
testcase_37 | AC | 201 ms
92,804 KB |
testcase_38 | WA | - |
testcase_39 | AC | 206 ms
92,624 KB |
testcase_40 | WA | - |
testcase_41 | AC | 199 ms
92,960 KB |
testcase_42 | AC | 201 ms
92,788 KB |
testcase_43 | AC | 213 ms
92,900 KB |
testcase_44 | AC | 212 ms
92,780 KB |
testcase_45 | WA | - |
ソースコード
import sys, re 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(): x, y, h = i_map() x *= 1000 y *= 1000 ans = 0 while x > h or y > h: if x > h: x /= 2 h *= 2 ans += 1 continue if y > h: y /= 2 h *= 2 ans += 1 print(ans) if __name__ == '__main__': main()