Submission

Score: 100

User: SushiCodelnw

Problemset: อนุกรม

Language: cpp

Time: 0.002 second

Submitted On: 2025-09-26 11:37:58

#include <iostream>
using namespace std;

long long c[100] = {0};

long long fib(long long num) {
    if (c[num] != 0) return c[num];
    c[num] = fib(num - 1) + fib(num - 2);
    return c[num];
}

int main() {
    c[0] = 1;
    c[1] = 1;

    long long n;
    cin >> n;

    cout << fib(n - 1);

    return 0;
}