Submission

Score: 100

User: Alif_Sama

Problemset: อนุกรม

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-02 19:51:33

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n;
    cin >> n;
    n += 1;
    unsigned long long int fib[10000] = {1,1,2,3};
    if (n >= 3) {
        for (int i = 3; i <= n; i++) {
            fib[i] = fib[i-1] + fib[i-2];
        }
    }
    cout << fib[n-2];
}