#include <stdio.h>
int s[7500][670];
void solve()
{
s[1][1] = 1;
s[2][1] = 1;
s[3][1] = 1;
s[4][1] = 1;
int i,j,k=0;
for(i = 5;i<7500;i++)
for( j = 1;j<=670 ;j++)
{
k += s[i-1][j]+s[i-2][j]+s[i-3][j]+s[i-4][j];
s[i][j] = k%10000;
k = k/10000;
}
while(k)
{
s[i][j++] = k%10000;
k = k/10000;
}
}
int main()
{
int n,i,j;
solve();
while(scanf("%d",&n)!=EOF)
{
for(i = 670; i>=1;i--)
if(s[n][i]!=0)
break;
printf("%d",s[n][i]);
for(j = i-1;j>=1;j--)
printf("%d",s[n][j]);
printf("\n");
}
return 0;
}
斐波那契大数问题
最新推荐文章于 2020-08-22 23:14:27 发布