Submission

Score: 100

User: cyblox_boi

Problemset: อนุกรม

Language: cpp

Time: 0.004 second

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

#include <iostream>
#include <vector>
using namespace std;

long long fibonacci(int n, vector<long long> &memo)
{
    if (n == 0)
    {
        return 0;
    }

    if (n == 1)
    {
        return 1;
    }

    if (memo[n] != -1)
    {
        return memo[n];
    }

    memo[n] = fibonacci(n - 1, memo) + fibonacci(n - 2, memo);

    return memo[n];
}

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

    vector<long long> memo(n + 1, -1);

    cout << fibonacci(n, memo) << '\n';

    return 0;
}