（斐波那契数列博弈）取石子游戏--HDOJ

取石子游戏

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

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>
    #include<stdio.h>

    using namespace std;

   long long  f[50],n;
    const __int64 inf = 2147483648+10;
    int main(void)
    {
        f[1] = 1;
        f[2] = 1;
        int i,len;
        for(i=3; i<=1000000; ++i)
        {
            f[i] = f[i-1] + f[i-2];
            if(f[i] >= inf)
                break;
        }
        len = i;

        while(scanf("%lld",&n)&&n)
        {
            int flg = 0;
            for(int i=1; i<len; ++i)
            {
                if(f[i] == n)
                {
                    flg = 1;
                    break;
                }
                if(f[i] > n) break;
            }
            if(flg)
                cout << "Second win"<<endl;
            else
                cout << "First win"<<endl;
        }

        return 0;
    }