//实现斐波那契数列
#include<iostream.h>
int l=2,m=0,n=0;
void main(){
int intShulie[30];
intShulie[0]=1;
intShulie[1]=1;
while(l<30){
intShulie[l]=intShulie[l-1]+intShulie[l-2];
++l;
}
cout<<"斐波那契数列前30个数为:"<<endl;
while(m<30){
++n;
cout<<intShulie[m]<<" ";
if(n==5){
cout<<endl;
n=0;
}
++m;
}
}
#include<iostream.h>
int l=2,m=0,n=0;
void main(){
int intShulie[30];
intShulie[0]=1;
intShulie[1]=1;
while(l<30){
intShulie[l]=intShulie[l-1]+intShulie[l-2];
++l;
}
cout<<"斐波那契数列前30个数为:"<<endl;
while(m<30){
++n;
cout<<intShulie[m]<<" ";
if(n==5){
cout<<endl;
n=0;
}
++m;
}
}
//endl表示换行;
//以下为运行结果::