#include<iostream>
using namespace std;
int Fibonacci(int n){
if(n<=2)return 1;
return Fibonacci(n-1)+Fibonacci(n-2);
}
int FibonacciT(int n)
{
if(n==1||n==2) return 1;
int a=1,b=1,sum,i;
for(i=3;i<=n;i++)
{
sum=a+b;
a=b;
b=sum;
}
return sum;
}
int main(){
int i,n=6;
for(int i=1;i<=n;i++){
cout<<Fibonacci(i)<<endl;
}
cout<<endl;
cout<<"Fibonacci递归第"<<n<<"个值为:"<<Fibonacci(n)<<endl;
cout<<"Fibonacci递推第"<<n<<"个值为:"<<FibonacciT(n)<<endl;
return 0;
}