結果
問題 | No.887 Collatz |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 11:43:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 146 ms / 2,000 ms |
コード長 | 1,689 bytes |
コンパイル時間 | 420 ms |
コンパイル使用メモリ | 82,440 KB |
実行使用メモリ | 89,896 KB |
最終ジャッジ日時 | 2024-04-18 11:07:00 |
合計ジャッジ時間 | 5,755 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 136 ms
89,600 KB |
testcase_01 | AC | 139 ms
89,564 KB |
testcase_02 | AC | 138 ms
89,600 KB |
testcase_03 | AC | 134 ms
89,408 KB |
testcase_04 | AC | 134 ms
89,600 KB |
testcase_05 | AC | 141 ms
89,728 KB |
testcase_06 | AC | 132 ms
89,872 KB |
testcase_07 | AC | 136 ms
89,600 KB |
testcase_08 | AC | 136 ms
89,640 KB |
testcase_09 | AC | 134 ms
89,600 KB |
testcase_10 | AC | 139 ms
89,152 KB |
testcase_11 | AC | 136 ms
89,600 KB |
testcase_12 | AC | 138 ms
89,896 KB |
testcase_13 | AC | 142 ms
89,608 KB |
testcase_14 | AC | 144 ms
89,584 KB |
testcase_15 | AC | 138 ms
89,232 KB |
testcase_16 | AC | 135 ms
89,600 KB |
testcase_17 | AC | 138 ms
89,152 KB |
testcase_18 | AC | 137 ms
89,172 KB |
testcase_19 | AC | 134 ms
89,228 KB |
testcase_20 | AC | 131 ms
89,216 KB |
testcase_21 | AC | 139 ms
89,168 KB |
testcase_22 | AC | 135 ms
89,600 KB |
testcase_23 | AC | 137 ms
89,640 KB |
testcase_24 | AC | 137 ms
89,600 KB |
testcase_25 | AC | 146 ms
89,540 KB |
testcase_26 | AC | 142 ms
89,516 KB |
testcase_27 | AC | 136 ms
89,500 KB |
testcase_28 | AC | 138 ms
89,728 KB |
testcase_29 | AC | 138 ms
89,344 KB |
testcase_30 | AC | 136 ms
89,600 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()) if N == 1: print(0) print(1) exit() nums = [N] p = 0 for i in range(1000): if nums[-1] % 2 == 0: nxt = nums[-1] // 2 else: nxt = nums[-1] * 3 + 1 nums.append(nxt) if nxt == 1: p = i break print(p+1) print(int(max(nums))) if __name__ == '__main__': main()