Submission

Score: 100

User: RaweerojFirst

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-17 11:41:29

#include<stdio.h>
#include<math.h>
#include<limits.h>

int main()
{
    int n;
    scanf("%d", &n);
    long long fn_2 = 0;
    long long fn_1 = 1;
    long long fibo = 0;
    long long total = 1;
    for (int i=2;i<=n;i++)
    {
        fibo = fn_2 + fn_1;
        total += fibo;

        fn_2 = fn_1;
        fn_1 = fibo;
    }
    printf("%lld\n", total);
    return 0;
}