2747번: 피보나치 수 (구현, 재귀) - Fastcampus

www.acmicpc.net/problem/2747

2747번: 피보나치 수

# 반복
def fibo(n):
    a, b = 0, 1
    for _ in range(n-1):
        a, b = b, a+b
    return b


# 재귀
def fibo(n):
    if n <= 1:
        return n
    return fibo(n-1) + fibo(n-2)


# DP
def fibo(n):
    ck = [0] * (n+1)
    ck[0] = 0
    ck[1] = 1
    for i in range(2, n+1):
        ck[i] = ck[i-1] + ck[i-2]
    return ck[n]


n = int(input())
print(fibo(n))