hdu 1250 Hat's Fibonacci

Hat's Fibonacci

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

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.
  
  

 

 

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#define M 510
const int T=10000;
int a[M],b[M],c[M],d[M],f[M];
void Fibo(int n)
{
	int i,j;
	a[0]=1;
	b[0]=1;
	c[0]=1;
	d[0]=1;
	for(i=5;i<=n;i++)
	{
		for(j=0;j<M;j++)
			f[j]=a[j]+b[j]+c[j]+d[j];
		for(j=0;j<M;j++)
			if(f[j]>=T)
			{
				f[j+1]+=f[j]/T;
				f[j]%=T;
			}
		for(j=0;j<M;j++)
		{
			a[j]=b[j];b[j]=c[j];
			c[j]=d[j];d[j]=f[j];
		}
	}
}
int main()
{
	int i,j,flag,n;
	while(scanf("%d",&n)!=-1)
	{
		if(n<5)
		{
			printf("1\n");
			continue;
		}
		memset(a,0,sizeof(a));
    	memset(b,0,sizeof(b));
    	memset(c,0,sizeof(c));
    	memset(d,0,sizeof(d));
    	memset(f,0,sizeof(f));
		Fibo(n);
		flag=0;
		for(i=M-1;i>=0;i--)
		{
			if(flag)
				printf("%04d",f[i]);
			else if(f[i])
			{
				printf("%d",f[i]);
				flag=1;
			}
		}
		printf("\n");
	}
	return 0;
}