HDU 2516 取石子游戏

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

Source

ECJTU 2008 Autumn Contest

斐波那契博弈

#include<iostream>
using namespace std;
//不要小瞧人生啊
//斐波那契博弈
//超出48會爆棧
int main()
{
    int f[50];
    f[0] = 0; f[1] = 1;
    int  n;
    for (int i = 2; i < 48; i++)
    {
        f[i] = f[i - 2] + f[i - 1];
    }
    while (cin >> n&&n)
    {
        bool flag = 0;
        for (int i = 3; i < 48; i++)
        {
            if (n == f[i])
            {
                flag = 1;
                break;
            }
        }
        if (flag)
            cout << "Second win" << endl;
        else
            cout << "First win" << endl;
    }
    return 0;
}