HDU1250--Hat's Fibonacci hdu(98)

#pragma warning(disable:4786)
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<ctime>
#include<string.h>
using namespace std;
#define pi acos(-1.0)
//#define LL __int64
typedef long long LL;
#define INF 0x7fffffffffffffff
#define bug puts("hear!")
#define inf 0x7fffffff
#define eps 1e-10
#define FRE freopen("in.txt","r",stdin)
#define E exp(1.0)
#define mod 1000000007

int num[10000][260]={0};

int main(){
   int i,j,n;
   num[1][0]=1;
   num[2][0]=1;
   num[3][0]=1;
   num[4][0]=1;
   for(i=5;i<10000;i++)
    {
       for(j=0;j<260;j++)
           num[i][j]=num[i-1][j]+num[i-2][j]+num[i-3][j]+num[i-4][j];
       for(j=0;j<259;j++)
           if(num[i][j]>100000000)
           {
               num[i][j+1]+=num[i][j]/100000000;
                num[i][j]%=100000000;
           }
    }
   while(scanf("%d",&n)!=EOF)
    {
       for(i=259;i>0;i--)
           if(num[n][i]!=0)
                break;
                     printf("%d",num[n][i]);
                     for(j=i-1;j>=0;j--)
                            printf("%08d",num[n][j]);
                     printf("\n");
    }
   return 0;
}

很恶心的题。比如判定第一位为0.