斐波拉契博弈

取石子游戲

Problem Description

1堆石子有n個,兩人輪流取.先取者第1次可以取任意多個，但不能全部取完.以後每次取的石子數不能超過上次取子數的2倍。取完者勝.先取者負輸出"Second win".先取者勝輸出"First win".

 

Input

輸入有多組.每組第1行是2<=n<2^31. n=0退出.

 

Output

先取者負輸出"Second win". 先取者勝輸出"First win". 
參看Sample Output.

 

Sample Input

2 13 10000 0

 

Sample Output

Second win Second win First win

(適用於特殊的題型)

#include<iostream>
#include<map>
using namespace std;
int main()
{
    int fib[500];
    fib[0] = 1, fib[1] = 2;
    for (int i = 2; i <= 70;i++)
        fib[i] = fib[i - 1] + fib[i - 2];
    int n;
    while (cin >> n&&n)
    {
        int mark = 0;
        for (int i = 0; i <= 70; i++) {
            if (fib[i] == n) mark = 1, cout << "Second win" << endl;
            if (fib[i] > n) break;
        }
        if (!mark) cout << "First win" << endl;
    }

    return 0;
}