Submission

Score: 100

User: spiwips

Problemset: อนุกรม

Language: python

Time: 0.011 second

Submitted On: 2025-09-30 22:37:27

inp = int(input())
memo = {}
def fibs(n):
    if n == 1:
        return 1
    if n == 2:
        return 1
    if n in memo:
        return memo[n]
    memo[n] = fibs(n-1)+fibs(n-2)
    return memo[n]
print(fibs(inp))