Read post
#include<stdio.h>
int main()
{
long long a[100],i=1,n[100],max=0,j;
while(scanf("%lld",&n[i])!=EOF)
{ if(n[i]>max) max=n[i];
i++;
}
a[0]=0;a[1]=1;a[2]=2;
for(j=3;j<=max;j++)
{
a[j]=a[j-3]+a[j-2]+a[j-1];
}
for(j=1;j<=i-1;j++)
{
printf("The Fibonacci number for %lld is %lld\n",n[j],a[n[j]]);
}
return 0;
}
Reply
|