peiboneiagreesthesequence.txt

Pei Bonei agrees the sequence

//裴波那契数列(1,1,2,3,5,8……)
//规律:f(1)=1,f(2)=1,f(n)=f(n-1)+f(n-2)...(n>2)

//循环算法(求前n个fibonacci数)
#include<iostream.h>
#include<iomanip.h>
void main()
{
int fab1=1,fab2=1,fabn,n,i;
cout<<"input the quantity number:";
cin>>n;
cout<<setiosflags(ios::right)<<setw(3)<<fab1;
cout<<setiosflags(ios::right)<<setw(3)<<fab2;
for(i=3;i<=n;i++)
{
  fabn=fab1+fab2;
  fab1=fab2;
  fab2=fabn;
  cout<<setiosflags(ios::right)<<setw(3)<<fabn;
}
cout<<endl;
}

/*递归算法(求第n个fibonacci数)
#include<iostream.h>
#include<iomanip.h>
int fibonacci(int);
void main()
{
int n;
cout<<"input the serial number:";
cin>>n;
cout<<"the fibonacci you want is:"
  <<fibonacci(n)<<endl;
}
int fibonacci(int n)
{
if(n==1||n==2)
  return 1;
else
  return fibonacci(n-1)+fibonacci(n-2);
}*/