HDOJ 2516-取石子游戏

取石子游戏

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3793    Accepted Submission(s): 2263

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

213100000

 

Sample Output

Second winSecond winFirst win

 

Source

ECJTU 2008 Autumn Contest 

解题思路：

是斐波那契额数列都是 Second win。

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int map[1000000];int main(){int n;int i,j;map[0]=1,map[1]=2;for(i=2;i<1000000;i++){map[i]=map[i-2]+map[i-1];}while(scanf("%d",&n)&&n){int xx;int yy=0;while(1){if(map[yy]==n){xx=1;break;}if(map[yy]>n){xx=0;break;}yy++;}if(xx==1)printf("Second win\n");elseprintf("First win\n");}return 0;}