//斐波那契数列
#include <iostream>
using namespace std;
long long Fibonacci(unsigned int);
int main(int argc, const char * argv[]) {
int x=0;
cin>>x;
cout<<Fibonacci(x)<<endl;
return 0;
}
long long Fibonacci(unsigned int n){
if(n==0)
return 0;
if(n==1)
return 1;
return Fibonacci(n-1)+Fibonacci(n-2);
}
算法实例:斐波那契(Fibonacce)数列
最新推荐文章于 2022-11-08 07:51:40 发布