← Back to List

25802번: Fiborooji Sequence ↗

Solutions

Python 3
880 B | 880 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
    sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)

def solve():
    d = {}

    a, b = mii()
    cnt = 1

    while d.get((a, b), 0) == 0:
        d[(a, b)] = cnt

        a, b = b, (a + b) % 10
        cnt += 1

    p(cnt + 1)

if __name__ == "__main__":
    tc = 1
    for t in range(1, tc+1):
        ret = solve()