Submission

Score: 50

User: rice_ot

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-17 12:00:52

#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n; cin>>n;
	vector<int> fibo(2);
	fibo[0] = 0;
	fibo[1] = 1;
	
	long long sum = 0;
	for(int i = 0; i<n; i++){
	    fibo.push_back(fibo[i]+fibo[i+1]);
	    sum+=fibo[i+1];
	}
	cout<<sum;
}