hdu 2516 取石子游戏 (博弈)

取石子游戏

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

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

 

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  2509 2512 2510 1524 2515 

 

//0MS    232K    345 B    G++    
/*

    先取为负的情况符合斐波那契数列. 

*/
#include<stdio.h>
int main(void)
{
    int n;
    int a[50]={0,1};
    for(int i=2;i<50;i++)
        a[i]=a[i-1]+a[i-2];
    while(scanf("%d",&n),n)
    {
        int flag=0;
        for(int i=1;i<50;i++)
            if(n==a[i]) flag=1;
        if(flag) puts("Second win");
        else puts("First win");
    }
    return 0;
}