結果
問題 | No.1869 Doubling? |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 18:51:53 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,638 bytes |
コンパイル時間 | 338 ms |
コンパイル使用メモリ | 87,000 KB |
実行使用メモリ | 92,748 KB |
最終ジャッジ日時 | 2023-09-24 07:42:32 |
合計ジャッジ時間 | 14,371 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 248 ms
92,496 KB |
testcase_01 | AC | 252 ms
92,368 KB |
testcase_02 | AC | 256 ms
92,320 KB |
testcase_03 | AC | 252 ms
92,524 KB |
testcase_04 | AC | 247 ms
92,340 KB |
testcase_05 | AC | 246 ms
92,276 KB |
testcase_06 | AC | 251 ms
92,352 KB |
testcase_07 | AC | 246 ms
92,484 KB |
testcase_08 | AC | 258 ms
92,644 KB |
testcase_09 | WA | - |
testcase_10 | AC | 259 ms
92,564 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 249 ms
92,308 KB |
testcase_16 | AC | 249 ms
92,496 KB |
testcase_17 | AC | 251 ms
92,564 KB |
testcase_18 | AC | 248 ms
92,396 KB |
testcase_19 | AC | 247 ms
92,536 KB |
testcase_20 | AC | 245 ms
92,416 KB |
testcase_21 | AC | 248 ms
92,252 KB |
testcase_22 | AC | 249 ms
92,492 KB |
testcase_23 | AC | 246 ms
92,468 KB |
testcase_24 | AC | 243 ms
92,404 KB |
testcase_25 | AC | 247 ms
92,444 KB |
testcase_26 | AC | 250 ms
92,320 KB |
testcase_27 | AC | 247 ms
92,400 KB |
testcase_28 | AC | 252 ms
92,464 KB |
testcase_29 | AC | 250 ms
92,624 KB |
testcase_30 | AC | 252 ms
92,444 KB |
testcase_31 | AC | 253 ms
92,308 KB |
testcase_32 | AC | 250 ms
92,316 KB |
testcase_33 | AC | 249 ms
92,508 KB |
testcase_34 | AC | 248 ms
92,376 KB |
testcase_35 | AC | 247 ms
92,528 KB |
testcase_36 | AC | 247 ms
92,496 KB |
testcase_37 | AC | 256 ms
92,252 KB |
testcase_38 | AC | 250 ms
92,568 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 252 ms
92,552 KB |
testcase_43 | AC | 250 ms
92,460 KB |
testcase_44 | WA | - |
testcase_45 | AC | 251 ms
92,644 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 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, m = i_map() ans = m cou = 1 now = m while now > 1 and cou < n: if now % 2 == 0: now //= 2 else: now //= 2 now += 1 cou += 1 ans += now #print(now) nokori = n - cou print(ans + nokori) if __name__ == '__main__': main()