题目1205：N阶楼梯上楼问题

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
using namespace std;
//1025 非递归
int n;
long long int dig[100];
int main(){
    while(cin>>n){
        dig[1]=1,dig[2]=2;
        for(int i=3;i<=n;i++)
            dig[i]=dig[i-1]+dig[i-2];
        cout<<dig
<<endl;
    }
    return 0;
}
/**************************************************************
    Problem: 1205
    User: cust123
    Language: C++
    Result: Accepted
    Time:10 ms
    Memory:1520 kb
****************************************************************/