#include<iostream.h>
int f(int n)
{
if(n <= 1)
return 1;
return f(n - 1) + f(n - 2);
}
int main()
{
int n;
cout <<"请输入数"<<endl;
cin >> n;
cout << f(n);
return 0;
}
递归实现斐波拉契数列
最新推荐文章于 2021-11-05 18:18:13 发布
#include<iostream.h>
int f(int n)
{
if(n <= 1)
return 1;
return f(n - 1) + f(n - 2);
}
int main()
{
int n;
cout <<"请输入数"<<endl;
cin >> n;
cout << f(n);
return 0;
}