Fibonacci（斐波那契）非递归实现。容易看懂

#include<iostream>
using namespace std;
int main(){
int n;
cout<<"please input a n\n";
cin>>n;
int i=0;
int a,b,result;
a=1;
result=0;
while (i<=n){
b=a+result;
a=result;
cout<<result<<"+"<<b<<"---"<<b<<endl;
result=b;
i++;

}
int temp;
cin>>temp;

}