取石子游戏
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 44 Accepted Submission(s) : 20
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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 Output.
Sample Input
2 13 10000 0
Sample Output
Second win Second win First win
Source
ECJTU 2008 Autumn Contest
程序如下(已AC):
#include<stdio.h>
int main()
{
__int64 n,i,j;
__int64 a[45];
while(scanf("%I64d",&n),n)
{
j=0;
a[0]=2;
a[1]=3;
for(i=2;i<45;i++)
{
a[i]=a[i-1]+a[i-2];
}
for(i=0;i<45;i++)
{
if(a[i]==n)
{
j=1;
break;
}
}
if(j==1)
printf("Second win\n");
else
printf("First win\n");
}
return 0;
}
//此题与斐波纳契数较相似,只要n的值满足如2,3,5,8,13········等等就是Second win。