資料結構 費氏數列

費氏數列，使用迴圈的方法

#include <iostream>
using namespace std;

void main()
{
    int Number;
    int FibN;
    int FibN1;
    int FibN2;

    cout << "Please enter a number: ";
    cin >> Number;

    if(Number <= 1){
        cout <<"Fibonacci Numbers of " <<Number <<" = 1" <<endl;
    }else{
        FibN1 = 1;
        FibN2 = 0;

        for(int i=2; i<=Number; i++){
            FibN = FibN1 + FibN2;
            FibN2 = FibN1;
            FibN1 = FibN;
        }
    }

    cout <<"Fibonacci Numbers of " <<Number <<" = " << FibN<<endl;

    system("pause");
}

參考資料：
資料結構 黃國瑜/葉乃菁