#include<iostream>
using namespace std;
int recursion(int a);
int main()
{
int n;
cout << "请输入一个数:" << endl;
cin >> n;
cout << "兔子数列的第" << n << "项的值为:" << recursion(n);
return 0;
}
int recursion(int a)
{
if (a == 1 || a == 2)
return 1;
else
return recursion(a - 1) + recursion(a - 2);
}
斐波那契数列的简单实现
最新推荐文章于 2021-03-05 22:19:11 发布