HDU 2070 Fibbonacci Number 水题-优快云博客

这篇博客详细介绍了HDU 2070题目中的Fibbonacci数列概念，深入探讨了如何解决这个被认为是水题的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Fibbonacci Number

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 22580 Accepted Submission(s): 10392

Problem Description

Your objective for this question is to develop a program which will generate a fibbonacci number. The fibbonacci function is defined as such:

f(0) = 0
f(1) = 1
f(n) = f(n-1) + f(n-2)

Your program should be able to handle values of n in the range 0 to 50.

Input

Each test case consists of one integer n in a single line where 0≤n≤50. The input is terminated by -1.

Output

Print out the answer in a single line for each test case.

Sample Input

Sample Output

  
   2
3
5


   
    
     Hint
    Note:
   
    
you can use 64bit integer: __int64

Author

Lily

Source

浙江工业大学网络选拔赛

Recommend

linle | We have carefully selected several similar problems for you: 2064 2067 2068 2096 2065

就是斐波拉数列，直接打一下表，就能过，注意用长整型

ac代码：

#include <stdio.h>

long long a[55]={0,1};
int main()
{
	int i,j,n;
	
	for(i=2;i<52;i++)
	{
		a[i]=a[i-1]+a[i-2];
	}
	while(scanf("%d",&n),n!=-1)
	{
		printf("%I64d\n",a[n]);
	}
	
	return 0;
}