Submission

PPPPPPPPPP

Score: 100

User: TirpitZ

Problemset: อนุกรม

Language: c

Time: 0.001 second

Submitted On: 2024-10-12 15:49:05

#include<stdio.h>
int main()
{
	int n;
	scanf("%d",&n);
	if(n<=0)
	{
		return 0;
	}
	long long fibo[n];
	fibo[0]=1;	fibo[1]=1;
	for(int i=2;i<n;i++)
	{
		fibo[i]=fibo[i-1]+fibo[i-2];
	}
	printf("%lld",fibo[n-1]);
}