Fibonacci变长码

//递归算法
#include<iostream>
using namespace std;
int Fibonacci(int n)
{
if(n==2||n==1) return 1;
else return Fibonacci(n-1)+Fibonacci(n-2);
}

int main()
{
double n;
cout<<"Please input the area:";
cin>>n;
for( int i = 1; i < n; ++i )
cout<<Fibonacci(i)<<endl;
return 0;
}