HDU1250 高精度斐波那契数列

Hat's Fibonacci

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10568    Accepted Submission(s): 3507

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.

 

Author

戴帽子的

 

Recommend

Ignatius.L

#include <iostream>
#include <stdio.h>
using namespace std;
int a[][]={};
int main()
{
    int i,j,n;
    a[][]=;
    a[][]=;
    a[][]=;
    a[][]=;
    for(i=;i<;i++)
    {
        for(j=;j<;j++)
        {
            a[i][j]+=a[i-][j]+a[i-][j]+a[i-][j]+a[i-][j];
            a[i][j+]+=a[i][j]/;
            a[i][j]=a[i][j]%;
        }
    }
    while(cin>>n)
    {
        for(j=;j>=;j--)
        if(a[n][j]!=)
        break;
        cout<<a[n][j];
        for(j=j-;j>=;j--)
        printf("%08d",a[n][j]); //不能直接cout 数大的时候是错的 因为可能会输出七位 正常应该输出八位的 反正就是不对
        cout<<endl;
    }
    return ;
}