結果
問題 | No.954 Result |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 16:53:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 238 ms / 2,000 ms |
コード長 | 2,322 bytes |
コンパイル時間 | 687 ms |
コンパイル使用メモリ | 87,112 KB |
実行使用メモリ | 93,064 KB |
最終ジャッジ日時 | 2023-08-24 13:12:37 |
合計ジャッジ時間 | 11,004 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 231 ms
92,972 KB |
testcase_01 | AC | 232 ms
93,064 KB |
testcase_02 | AC | 232 ms
93,000 KB |
testcase_03 | AC | 227 ms
92,944 KB |
testcase_04 | AC | 232 ms
92,852 KB |
testcase_05 | AC | 231 ms
92,640 KB |
testcase_06 | AC | 233 ms
92,676 KB |
testcase_07 | AC | 234 ms
92,964 KB |
testcase_08 | AC | 234 ms
92,672 KB |
testcase_09 | AC | 234 ms
92,784 KB |
testcase_10 | AC | 234 ms
92,848 KB |
testcase_11 | AC | 232 ms
92,788 KB |
testcase_12 | AC | 232 ms
92,912 KB |
testcase_13 | AC | 232 ms
92,912 KB |
testcase_14 | AC | 232 ms
92,956 KB |
testcase_15 | AC | 233 ms
92,976 KB |
testcase_16 | AC | 231 ms
92,980 KB |
testcase_17 | AC | 235 ms
92,872 KB |
testcase_18 | AC | 237 ms
92,652 KB |
testcase_19 | AC | 234 ms
92,740 KB |
testcase_20 | AC | 235 ms
92,664 KB |
testcase_21 | AC | 231 ms
92,904 KB |
testcase_22 | AC | 233 ms
92,940 KB |
testcase_23 | AC | 234 ms
92,896 KB |
testcase_24 | AC | 232 ms
93,048 KB |
testcase_25 | AC | 234 ms
92,768 KB |
testcase_26 | AC | 230 ms
92,808 KB |
testcase_27 | AC | 232 ms
92,968 KB |
testcase_28 | AC | 231 ms
93,000 KB |
testcase_29 | AC | 238 ms
92,792 KB |
testcase_30 | AC | 233 ms
92,964 KB |
testcase_31 | AC | 236 ms
92,736 KB |
testcase_32 | AC | 233 ms
92,892 KB |
testcase_33 | AC | 235 ms
92,952 KB |
testcase_34 | AC | 231 ms
92,844 KB |
testcase_35 | AC | 233 ms
92,736 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(): fibo = [0] * 100 fibo[1] = 1 fibo[2] = 1 for i in range(3, 100): fibo[i] = fibo[i-1] + fibo[i-2] #print(fibo) lines = set() for i in range(1, 100): lines.add((fibo[i])) for i in range(1, 99): lines.add((fibo[i], fibo[i+1])) for i in range(1, 98): lines.add((fibo[i], fibo[i+1], fibo[i+2])) for i in range(1, 97): lines.add((fibo[i], fibo[i+1], fibo[i+2], fibo[i+3])) for i in range(1, 96): lines.add((fibo[i], fibo[i+1], fibo[i+2], fibo[i+3], fibo[i+4])) nums = [int(input()) for i in range(5)] nums = nums[::-1] ans = 0 if (nums[0], nums[1], nums[2], nums[3], nums[4]) in lines: print(5) exit() if (nums[0], nums[1], nums[2], nums[3]) in lines: print(4) exit() if (nums[0], nums[1], nums[2]) in lines: print(3) exit() if (nums[0], nums[1]) in lines: print(2) exit() if nums[0] in lines: print(1) exit() print(0) if __name__ == '__main__': main()