简单的斐波那契数列程序

#include<iostream>using namespace std;int main(){int a=1,b=1;int temp;int flag = 0;int num;cin>>num;if(num)cout<<a<<" ";while(num--){cout<<b<<" ";temp = b;b+=a;a = temp;}system("pause");return 0;}

非递归的斐波那契数列，数据大了就不行了。权当练习