close

//---------------------------------------------------------------------------
/****************************************************************************
範例6-1:計算小於100的費式數。費式數列(Fibonacci sequence)如下:            *
   1 1 2 3 5 8                                                              *
   計算方式如下:                                                           *
     1                                                                      *
     1                                                                      *
     2 = 1 + 1                                                              *
     3 = 1 + 2                                                              *
     5 = 3 + 2                                                              *
     ...依此類推。                                                          *
                                                                            *
     它的公式為:                                                           *
        fn = fn-1 + fn-2                                                   *
****************************************************************************/
#include <iostream>
//---------------------------------------------------------------------------
int old_number;      // 前一個費式數
int current_number;  // 現在的費式數
int next_number;     // 下一個費式數

int main(int argc, char* argv[])
{
        //起始時的設定
        old_number = 1;
        current_number = 1;

        std::cout << current_number << '\n'; //印出第一個數

        while (current_number < 100) {
          std::cout << current_number << '\n';
          next_number = current_number + old_number;

          old_number = current_number;
          current_number = next_number;
        }
        std::system("pause");
        return 0;
}
//---------------------------------------------------------------------------


題目來源:C++風格與藝術 第二版 Steve Oualline 著 黃吉霈 編譯

arrow
arrow
    全站熱搜

    jumbowind 發表在 痞客邦 留言(0) 人氣()