Submission

Score: 100

User: navysrimuang

Problemset: อนุกรม

Language: cpp

Time: 0.004 second

Submitted On: 2025-09-28 12:05:14

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;

int main(){

  int j; cin >> j;
  
  

    //int n; cin >> n;
    long long fib[101] = {1,1};
    for(int i = 2;i<j - 1 + 1;i++){
      fib[i] = fib[i-1] + fib[i-2];
      //cout << fib[i] << " ";
    }
    cout <<fib[j - 1] << endl;

  

  
  return 0;
}