Submission

Score: 100

User: winwin1054

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-31 16:35:41

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

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