Submission

Score: 100

User: Buktep

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.003 second

Submitted On: 2025-09-30 13:26:38

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 9e18;

int32_t main()
{
    int n; cin>>n;
    int sum=1;
    for(int i=0;i<=n;i++)
    {
        int n2=0,n1=1;
        int t=0;
        for(int j=2;j<=i;j++)
        {
            t = n2 + n1;
            n2 = n1;
            n1 = t;
        }
        sum += t;
    }
    cout<<sum;
    return 0;
}