Submission

Score: 50

User: samsenpisardmoo69

Problemset: อนุกรม

Language: cpp

Time: 1.097 second

Submitted On: 2026-10-02 14:09:30

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

long long fib(int n)
{
    if(n == 0) return 0;
    if(n == 1) return 1;
    return fib(n-1) + fib(n-2);
}

int main()
{
    int n;
    cin >> n;
    long long ans = fib(n);
    cout << ans;
}