POJ 1740：A New Stone Game

A New Stone Game

Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 5113 Accepted: 2806

Description
Alice and Bob decide to play a new stone game.At the beginning of the game they pick n(1<=n<=10) piles of stones in a line. Alice and Bob move the stones in turn.
At each step of the game,the player choose a pile,remove at least one stones,then freely move stones from this pile to any other pile that still has stones.
For example:n=4 and the piles have (3,1,4,2) stones.If the player chose the first pile and remove one.Then it can reach the follow states.
2 1 4 2
1 2 4 2（move one stone to Pile 2）
1 1 5 2（move one stone to Pile 3）
1 1 4 3（move one stone to Pile 4）
0 2 5 2（move one stone to Pile 2 and another one to Pile 3）
0 2 4 3（move one stone to Pile 2 and another one to Pile 4）
0 1 5 3（move one stone to Pile 3 and another one to Pile 4）
0 3 4 2（move two stones to Pile 2）
0 1 6 2（move two stones to Pile 3）
0 1 4 4（move two stones to Pile 4）
Alice always moves first. Suppose that both Alice and Bob do their best in the game.
You are to write a program to determine who will finally win the game.

Input
The input contains several test cases. The first line of each test case contains an integer number n, denoting the number of piles. The following n integers describe the number of stones in each pile at the beginning of the game, you may assume the number of stones in each pile will not exceed 100.
The last test case is followed by one zero.

Output
For each test case, if Alice win the game,output 1,otherwise output 0.

Sample Input
3
2 1 3
2
1 1
0

Sample Output
1
0

代码：

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int n[105];

int main()
{
int num;
while(cin>>num)
{
if(!num)
break;
memset(n,0,sizeof(n));

int i,temp;

if(num%2)
{
for(i=1;i<=num;i++)
cin>>temp;
cout<<1<<endl;
}
else
{
for(i=1;i<=num;i++)
{
cin>>temp;
n[temp]++;
}
int flag=0;
for(i=0;i<=104;i++)
{
if(n[i]%2)
flag=1;
}
if(flag)
cout<<1<<endl;
else
cout<<0<<endl;
}
}
return 0;
}


• 本文已收录于以下专栏：

测试开发面试真题（百度）

1、黑盒测试和白盒测试常用的测试方法有哪些？举例说明 白盒测试：逻辑覆盖法，主要包括语句覆盖、判断覆盖、条件覆盖、判断条件覆盖、条件组合覆盖和路径覆盖。     基本路径测试法。 黑盒测试：等价...

poj1740 A New Stone Game----分析P/N 从剩下的石子中取任意颗放到别的堆

A New Stone Game Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 4111 ...

【poj1740】 A New Stone Game

http://poj.org/problem?id=1740 (题目链接)男人八题之一题意：对于n堆石子，每堆若干个，两人轮流操作，每次操作分两步，第一步从某堆中去掉至少一个，第二步（可省略）把该堆剩...

poj 1740 A New Stone Game

A New Stone Game Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 4372 ...
• WEYuLi
• 2013年07月05日 08:47
• 566

POJ 1740 A New Stone Game 男人八题之一

POJ 1740 A New Stone Game Alice and Bob decide to play a new stone game.At the beginning of the game...
• Mrx_Nh
• 2017年04月09日 15:13
• 113

poj1740 A New Stone Game（博弈）

A New Stone Game Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5028 ...

poj 1740 A New Stone Game(博弈)

【题目大意】：有N堆石头,每堆石头数目在1到100之间,最多有10堆.两人分别取走石头.取石头的规则是:每次只能从1堆中取,每次取走至少1个.取过后还可以把这堆的石头任意分配到其它堆上，当然也可以不分...
• new_wu
• 2012年03月19日 20:50
• 325

【POJ1740】A New Stone Game 构造博弈

• Vmurder
• 2015年01月10日 15:17
• 683

POJ_1740 A New Stone Game 博弈

http://poj.org/problem?id=1740 题意： 给你N堆石子，每堆石子都有一定的数量，有两个人玩一个游戏，游戏的规则是每个人每次可以选择一堆石子，并从中去掉至少一颗石子，然后...

举报原因： 您举报文章：POJ 1740：A New Stone Game 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)