Submission

Score: 100

User: kakcode

Problemset: อนุกรม

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-11 21:57:55

/*
TASK: c1_bkk64_2
LANG: C++
AUTHOR: ICE
*/
#include <bits/stdc++.h>
using ll = long long;
#define forr(i, a, n) for (int i = a; i < n; i++)
const ll inf = 10e9;
#define int ll
using namespace std;
using pii = pair<int,int>;
int fib[101];
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    fib[0] = 1;
    fib[1] = 1;
    for(int i=2;i<101;i++){
        fib[i] = fib[i-1] + fib[i-2];
    }
    cout << fib[n-1];
    return 0;
}