結果
問題 | No.642 Two Operations No.1 |
ユーザー | McGregorsh |
提出日時 | 2022-06-30 22:29:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 249 ms / 2,000 ms |
コード長 | 1,491 bytes |
コンパイル時間 | 538 ms |
コンパイル使用メモリ | 86,644 KB |
実行使用メモリ | 92,920 KB |
最終ジャッジ日時 | 2023-08-16 10:17:06 |
合計ジャッジ時間 | 5,184 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,432 KB |
testcase_01 | AC | 234 ms
92,772 KB |
testcase_02 | AC | 234 ms
92,920 KB |
testcase_03 | AC | 233 ms
92,620 KB |
testcase_04 | AC | 232 ms
92,716 KB |
testcase_05 | AC | 236 ms
92,912 KB |
testcase_06 | AC | 236 ms
92,888 KB |
testcase_07 | AC | 236 ms
92,536 KB |
testcase_08 | AC | 242 ms
92,568 KB |
testcase_09 | AC | 249 ms
92,716 KB |
testcase_10 | AC | 237 ms
92,680 KB |
testcase_11 | AC | 238 ms
92,452 KB |
testcase_12 | AC | 237 ms
92,480 KB |
testcase_13 | AC | 238 ms
92,620 KB |
testcase_14 | AC | 235 ms
92,632 KB |
ソースコード
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(): n = int(input()) score = 0 while n > 1: if n % 2 == 1: n += 1 n //= 2 score += 2 else: n //= 2 score += 1 print(score) if __name__ == '__main__': main()