結果
問題 | No.1869 Doubling? |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 18:46:13 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,626 bytes |
コンパイル時間 | 373 ms |
コンパイル使用メモリ | 87,056 KB |
実行使用メモリ | 92,616 KB |
最終ジャッジ日時 | 2023-09-24 07:37:02 |
合計ジャッジ時間 | 14,242 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 231 ms
92,260 KB |
testcase_01 | AC | 235 ms
92,344 KB |
testcase_02 | AC | 239 ms
92,240 KB |
testcase_03 | AC | 237 ms
92,344 KB |
testcase_04 | AC | 232 ms
92,516 KB |
testcase_05 | AC | 233 ms
92,268 KB |
testcase_06 | AC | 236 ms
92,516 KB |
testcase_07 | AC | 237 ms
92,508 KB |
testcase_08 | AC | 235 ms
92,268 KB |
testcase_09 | WA | - |
testcase_10 | AC | 231 ms
92,464 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 236 ms
92,296 KB |
testcase_16 | AC | 235 ms
92,464 KB |
testcase_17 | AC | 240 ms
92,348 KB |
testcase_18 | AC | 238 ms
92,488 KB |
testcase_19 | AC | 235 ms
92,604 KB |
testcase_20 | AC | 234 ms
92,372 KB |
testcase_21 | AC | 236 ms
92,484 KB |
testcase_22 | AC | 236 ms
92,336 KB |
testcase_23 | AC | 236 ms
92,484 KB |
testcase_24 | AC | 232 ms
92,520 KB |
testcase_25 | AC | 235 ms
92,468 KB |
testcase_26 | AC | 233 ms
92,484 KB |
testcase_27 | AC | 232 ms
92,348 KB |
testcase_28 | AC | 234 ms
92,240 KB |
testcase_29 | AC | 232 ms
92,548 KB |
testcase_30 | AC | 239 ms
92,276 KB |
testcase_31 | AC | 241 ms
92,288 KB |
testcase_32 | AC | 235 ms
92,544 KB |
testcase_33 | AC | 242 ms
92,348 KB |
testcase_34 | AC | 239 ms
92,348 KB |
testcase_35 | AC | 241 ms
92,304 KB |
testcase_36 | AC | 240 ms
92,616 KB |
testcase_37 | AC | 246 ms
92,516 KB |
testcase_38 | AC | 240 ms
92,608 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 238 ms
92,492 KB |
testcase_43 | AC | 242 ms
92,504 KB |
testcase_44 | WA | - |
testcase_45 | AC | 241 ms
92,264 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: 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()