hdu 2516 取石子游戏 (Fibonacci博弈)

取石子游戏

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8159    Accepted Submission(s): 4950

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

C/C++：

#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstring>
#include <climits>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
#define LL long long
#define wzf ((1 + sqrt(5.0)) / 2.0)
using namespace std;

__int64 n, fib[45] = {1, 1};

void calc()
{
    for (__int64 i = 2; i <= 46; ++ i)
        fib[i] = fib[i - 1] + fib[i - 2];
}

bool is_fib()
{
    for (__int64 i = 2; i <= 45; ++ i)
    {
        if (fib[i] > n) return false;
        if (n == fib[i])
            return true;
    }
    return false;
}

int main()
{
    calc();
    while (scanf("%I64d", &n), n)
    {
        if (is_fib())
            printf("Second win
");
        else
            printf("First win
");
    }
    return 0;
}

 C/C++:

#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstring>
#include <climits>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
#define LL long long
using namespace std;

__int64 n, num[100] = {1, 1};

set <__int64> s;

void calc()
{
    s.insert(1);
    for (int i = 2; i <= 45; ++ i)
    {
        num[i] = num[i - 1] + num[i - 2];
        s.insert(num[i]);
    }
}

int main()
{
    calc();
    while (scanf("%I64d", &n), n)
    {
        if (s.find(n) != s.end())
            printf("Second win
");
        else
            printf("First win
");
    }
    return 0;
}