(斐波那契数列)Fibonacci数列是满足 F(0) = 1, F(1) = 1, F(n) = F(n-1)+F(n-2) (n>=2)的数列,数列的前几项为1,1,2,3,5,8,13,21,...。
仿照求解n的阶乘的写法,写出求解Fibonacci数列第n项的程序:
#include<cstdio>
#include<iostream>
#include<stdlib.h>
using namespace std;
int Fibonacci(int n)
{
if(n == 0 || n == 1)
return 1;
else
return Fibonacci(n-1) + Fibonacci(n-2);
}
int main(){
int n;
cin >> n;
cout << Fibonacci(n);
system("pause");
return 0;
}