#include<stdio.h>
#define max 5005
#define length 3000
int fib[max][length];
void fibonacci()
{
int i,j,rem=0;
fib[0][0]=0;
fib[1][0]=1;
for(i=2; i<max; i++)
{
for(j=0; j<length; j++)
{
fib[i][j]=fib[i-1][j]+fib[i-2][j]+rem;
rem=0;
if(fib[i][j]>9)
{
fib[i][j]=fib[i][j]%10;
rem=1;
}
}
}
}
int main()
{
int n,i,j,k,rem,test;
fibonacci();
scanf("%d",&test);
for(i=1;i<=test;i++)
{
scanf("%d",&n);
n=n+2;
for(j=length-1; j>0; j--)
{
if(fib[n][j]!=0)
{
break;
}
}
printf("Scenario #%d:\n",i);
for(; j>=0; j--)
{
printf("%d",fib[n][j]);
}
printf("\n\n");
}
return 0;
}
#define max 5005
#define length 3000
int fib[max][length];
void fibonacci()
{
int i,j,rem=0;
fib[0][0]=0;
fib[1][0]=1;
for(i=2; i<max; i++)
{
for(j=0; j<length; j++)
{
fib[i][j]=fib[i-1][j]+fib[i-2][j]+rem;
rem=0;
if(fib[i][j]>9)
{
fib[i][j]=fib[i][j]%10;
rem=1;
}
}
}
}
int main()
{
int n,i,j,k,rem,test;
fibonacci();
scanf("%d",&test);
for(i=1;i<=test;i++)
{
scanf("%d",&n);
n=n+2;
for(j=length-1; j>0; j--)
{
if(fib[n][j]!=0)
{
break;
}
}
printf("Scenario #%d:\n",i);
for(; j>=0; j--)
{
printf("%d",fib[n][j]);
}
printf("\n\n");
}
return 0;
}
0 comments: (+add yours?)
Post a Comment