Submission

Score: 50

User: rice_ot

Problemset: Fibonacci Croissant

Language: cpp

Time: 1.095 second

Submitted On: 2025-10-17 11:53:30

#include <bits/stdc++.h>

using namespace std;

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


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n; cin>>n;
	cout<< fibo(n, 1);
	
}