HDU 1250-Hat's Fibonacci（大数）

address:http://acm.hdu.edu.cn/showproblem.php?pid=1250
Problem Description
A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.

Input
Each line will contain an integers. Process to end of file.

Output
For each case, output the result in a line.

Sample Input
100

Sample Output
4203968145672990846840663646

Note:
No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.

code:

#include <iostream>
#include <string.h>
#include <cstdio>
using namespace std;
int a[8001][260];
int main ()
{
    int i,j;
     memset(a,0,sizeof(a));
    a[1][0]=1;
    a[2][0]=1;
    a[3][0]=1;
    a[4][0]=1;
    for (i=5;i<=8000;i++)
    {
        for (j=0;j<260;j++)
        {
            a[i][j] += a[i-1][j]+a[i-2][j]+a[i-3][j]+a[i-4][j];
        }
        for(j=0;j<260;j++)                //每八位考虑进位。
            if(a[i][j]>100000000)
            {
                a[i][j+1]+=a[i][j]/100000000;
                a[i][j]=a[i][j]%100000000;
            }
    }
   // cout<<count<<endl;
    int x;
    while (cin>>x)
    {
        int flag=0;
        for (i=259;i>=0;i--)
        {
            if (a[x][i]!=0)
                break;
        }
       printf("%d",a[x][i]);
        for (i--;i>=0;i--)
        {
            printf ("%08d",a[x][i]);
        }
        cout<<endl;
    }
    return 0;
}