Submission

Score: 50

User: pete

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.002 second

Submitted On: 2026-01-23 22:22:12

#include<bits/stdc++.h>

using namespace std;

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