HDU1250 Hat's Fibonacci

最新推荐文章于 2019-08-20 20:06:12 发布

星_尘

最新推荐文章于 2019-08-20 20:06:12 发布

阅读量470

点赞数

分类专栏： hduoj 文章标签： cc++

本文链接：https://blog.csdn.net/travel_1/article/details/40260981

版权

hduoj 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

Hat's Fibonacci

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

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

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<stdlib.h>
#include<string.h>
#define M 8000
int num[M][700]={{1},{1},{1},{1},{1}};
void f()
{
	int i,j,s=0;
	for(i=5;i<M-1;i++)
		for(j=0;j<699;j++)
		{
			s+=num[i-4][j]+num[i-3][j]+num[i-2][j]+num[i-1][j];
			num[i][j]=s%10000;
			s=s/10000;
		}
	while(s)
	{
		num[i][j++]=s%10000;
		s=s/10000;
	}
}
int main()
{
	int n;
	int i,j;
	f();
	while(scanf("%d",&n)!=EOF)
	{
		for(i=690;num[n][i]==0;i--)
			;
		printf("%d",num[n][i]);
		for(j=i-1;j>=0;j--)
			printf("%04d",num[n][j]);
		printf("\n");
	}
	return 0;
}