Submission

Score: 50

User: patsa_v

Problemset: อนุกรม

Language: cpp

Time: 1.097 second

Submitted On: 2026-10-05 16:46:37

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


int fibonucci(int n){
    if(n < 0){
        return 0;
    }else{
        if(n <= 1){
            return 1;
        }
    }

    return fibonucci(n-1) + fibonucci(n-2);
}

int main(){
    int i;
    cin >> i;
    cout << fibonucci(i-1);
    return 0;
}