Submission

Score: 100

User: hmmm

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.002 second

Submitted On: 2025-08-03 21:37:11

#include<bits/stdc++.h>
using namespace std;
const int N=100;
long long int a[N];

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    a[0]=0,a[1]=1;
    for(int i=2;i<=n;i++){
        a[i]=a[i-1]+a[i-2];
    }
    unsigned long long sum=0;
    for(int i=0;i<=n;i++){
        sum+=a[i];
    }
    cout << sum;
}