[백준] 2748 피보나치 수 2

https://www.acmicpc.net/problem/2748

#include <cstdio>

long long int fibo[91];
int main() {
    int n;
    scanf("%d", &n);

    fibo[1] = 1;
    for (int i = 2; i <= n; i++){
        fibo[i] = fibo[i-1]+fibo[i-2];
    }
    printf("%lld\n", fibo[n]);
}