Fibonacci（斐波那契）递归实现。容易看懂

#include<iostream>
using namespace std;
int fibonacci(int n){
if(n<=0)
return 0;
else if(n==1)
return 1;
else
return fibonacci(n-1)+fibonacci(n-2);
}

int main(){
int n,s;
cout<<"please input a n to be the max of fibonacci\n";
cin>>n;
for(int i=0;i<=n;i++){
s=fibonacci(i);
cout<<s<<"+"<<s-1<<"-----";
cout<<fibonacci(i)<<"\n";
}
int temp;
cin>>temp;
}