Submission

Score: 50

User: Ricon

Problemset: อนุกรม

Language: cpp

Time: 1.097 second

Submitted On: 2025-10-06 21:46:51

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

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

int main() {
    int n;
    cin >> n;

    cout << fibon(n);

    return 0;
}