Submission

Score: 100

User: MoZkun

Problemset: Fibonacci Croissant

Language: cpp

Time: 0.002 second

Submitted On: 2025-09-30 10:59:16

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

int main() {
    int n;
    cin >> n;

    long long a = 0, b = 1, c;
    for (int i = 2; i <= n+2; i++) {
        c = a + b;
        a = b;
        b = c;
    }

    cout << b - 1 << endl;

    return 0;
}