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.
InputEach test case consists of one integer n in a single line where 0≤n≤50. The input is terminated by -1.OutputPrint out the answer in a single line for each test case.Sample Input
3
4
5
-1
Sample Output
2
3
5
you can use 64bit integer: __int64
#include<iostream>
using namespace std;
int main()
{
int n,i;
long long a[51]={0,1};
for(i=2;i<51;i++)
{
a[i]=a[i-1]+a[i-2];
}
while(cin>>n&&n!=-1)
{
cout<<a[n]<<endl;
}
return 0;
}
题解:第好多好多遍写斐波那契呢~
本文介绍了一个用于生成斐波那契数列的C++程序,该程序能够高效地处理0到50范围内的输入值。通过预先计算并存储斐波那契数列的前51项,避免了重复计算,显著提高了程序运行效率。
493

被折叠的 条评论
为什么被折叠?



