Submission

Score: 100

User: Songkran

Problemset: อนุกรม

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-04 21:59:27

#include <bits/stdc++.h>
using namespace std;


long long nthFibonacci(long long n){
    if (n <= 1)
        return n;
    vector<long long> dp(n + 1);
    dp[0] = 0;
    dp[1] = 1;
    for (int i = 2; i <= n; ++i){
        dp[i] = dp[i - 1] + dp[i - 2];
    }

    return dp[n];
}

int main(){
    long long n; cin >> n;
    long long result = nthFibonacci(n);
    cout << result;
    return 0;
}