Submission

Score: 100

User: VggT

Problemset: อนุกรม

Language: cpp

Time: 0.003 second

Submitted On: 2025-10-16 22:45:37

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

long long fibo(int n,vector<long long> &dp)
{
	if(n == 0) return 0;
	if(n == 1) return 1;
	
	if(dp[n] != -1) return dp[n];

	return dp[n] = fibo(n-1,dp) + fibo(n-2,dp);
}

int main()
{
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	vector<long long> dp(n+1,-1);
	
	
	
	cout << fibo(n,dp);
}