Submission

Status:

PPPPPPPPPP

Score: 100

User: Namkhing

Problemset: อนุกรม

Language: cpp

Time: 0.002 second

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

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

using ll = long long;

const int N = 110;
ll n, dp[N];

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    cin >> n;
    dp[1] = dp[2] = 1;
    for (int i = 3; i <= n; i++) dp[i] = dp[i-1] + dp[i-2];
    cout << dp[n];
}