Submission

P---------

Score: 10

User: pxsit

Problemset: อนุกรม

Language: cpp

Time: 0.002 second

Submitted On: 2024-12-14 21:15:33

#include <bits/stdc++.h> // dp
using namespace std;
int n;
int main(void) {
    
    cin >> n;
    if (n == 1) {
        cout << 1;
        return 0;
    }
    if (n == 2) {
        cout << 1;
        return 0;
    }
    vector<int> dp(n+1, 0);
    dp[1] = 1;
    dp[2] = 1;
    for (int i = 3; i <= n+1; i++) dp[i] = dp[i-1] + dp[i-2];
    cout << dp[n+1];
}