Submission

PPPPPPPPPP

Score: 100

User: Augus30

Problemset: อนุกรม

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-01 17:13:28

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

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

int main() {
    int n; cin >> n;
    vector<long long> dp(n+1);
    cout << f(n,dp);
}