#include <iostream>
using namespace std;
int fun(int n)
{
if (n == 3||n==2)
{
return 1;
}
else if (n > 3)
{
return fun(n - 1) + fun(n - 2);
}
}
int main()
{
int n = 0;
cin >> n;
int i = 4;
cout << "0" << " " << "1" << " " << "1" << " ";
while (i>3&&i<=n)
{
cout << fun(i++) << " ";
}
cout << endl;
return 0;
}
递归求斐波那契而数列__2019.03.18
最新推荐文章于 2021-12-04 15:37:18 发布