Submission

Score: 100

User: Karatat007

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-08 13:38:06

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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long fibo[91];
    fibo[0] = 0;
    fibo[1] = 1;
    for(int i = 2;i <= 90;++i){
        fibo[i] = fibo[i-1] + fibo[i-2];
    }
    int n;
    cin >> n;
    long long sum = 0;
    for(int i = 1;i <= n;++i){
        sum += fibo[i];
    }
    cout << sum;
}