Submission

Score: 100

User: Dark_kingdom

Problemset: อนุกรม

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-07 16:49:19

#include <iostream>
using namespace std;
long long arr[100];
long long fibo(int n)
{
	if (n<=1) return n;
	if (arr[n] != 0)
	{
		return arr[n];
	}
	return arr[n] =  fibo(n-1) +fibo(n-2);
}
int main()
{
	int x;
	cin>> x;
	
	cout<<fibo(x);
	return 0;
}