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
这道题分析一下就会知道当n为斐波那契数列时,就会输出Second win
#include<stdio.h>
int main()
{
long long int a[60],n;
int flag ;
a[0] = 2, a[1] = 3;
for (int i = 2; i<60; i++)
a[i] = a[i - 1] + a[i - 2];
while (scanf_s("%lld", &n)!=EOF&&n)
{
flag = 0;
int j;
for (j = 0; j < 60; j++)
{
if (n == a[j])
{
flag = 1;
break;
}
}
if(flag==0)
printf("First win\n");
else
printf("Second win\n");
}
return 0;
}