this is my knowledge

my name is jiang he

Hat's Fibonacci

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

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

ac代码
#include<iostream>
#include<cstring>
#include<cmath>
#include<stdio.h>
using namespace std;
int a[7250][650];
int main()
{
memset(a,0,sizeof(a));
a[1][0]=1;
a[2][0]=1;
a[3][0]=1;
a[4][0]=1;
int i,j;
int p=1;
for(i=5;i<=7200;i++)
{
for(j=0;j<=p;j++)
{
a[i][j]=a[i-1][j]+a[i-2][j]+a[i-3][j]+a[i-4][j];
}
for(j=0;j<=p;j++)
{a[i][j+1]+=a[i][j]/10000;
a[i][j]=a[i][j]%10000;
}
if(a[i][p])
p++;
}
int n;
while(scanf("%d",&n)!=EOF)
{

int i;

for(i=p;i>=0;i--)
if(a[n][i]!=0)
break;
printf("%d",a[n][i--]);
for(;i>=0;i--)
{
printf("%04d",a[n][i]);
}

printf("\n");
}
return 0;
}


Hat's Fibonacci(杭电1250）

2014-10-20 16:24:05

【HDU】1250 - Hat's Fibonacci（java - BigDecimal）

2016-07-28 09:31:27

杭电ACM 1250 Hat's Fibonacci (还需再看)

2014-07-29 21:15:38

hdu 1250 Hat's Fibonacci

2014-03-01 18:27:29

HDU 1250： Hat's Fibonacci

2014-07-05 20:53:17

[大数] HDU 1250 - Hat's Fibonacci

2014-11-16 16:10:29

HDU 1250 Hat's Fibonacci (Java大数,类似Fib数,有个坑!!)

2016-05-15 23:34:47

HDU 1250 Hat's Fibonacci(递推+大数加法)

2015-09-10 09:25:01

HDOJ/HDU 1250 Hat's Fibonacci(大数~斐波拉契)

2016-05-21 20:22:20

1250 Hat's Fibonacci

2012-05-05 09:12:08

Hat's Fibonacci