hdu1250(大 数）Hat's Fibonacci

Hat's Fibonacci

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.

一个数组存好几位数。

#include<stdio.h>
#include<string.h>
int a[10001][261];
int main()
{
    memset(a,0,sizeof(a));
    a[1][0]=1;
    a[2][0]=1;
    a[3][0]=1;
    a[4][0]=1;
    a[5][0]=4;
    a[6][0]=7;
    for(int i=7; i<10000; i++)
    {
        for(int j=0; j<=260; j++)
        {
            a[i][j]+=a[i-1][j]+a[i-2][j]+a[i-3][j]+a[i-4][j];
            a[i][j+1]+=a[i][j]/100000000;
            a[i][j]%=100000000;
        }
    }
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int i;
        for(i=260;i>=0;i--)
        {
            if(a[n][i])
                break;
        }
        printf("%d",a[n][i]);
        i--;
        //printf("%d\n",i);
        for(;i>=0;i--)
        {
            printf("%.8d",a[n][i]);
        }
        printf("\n");
    }
}