POJ 1740--A New Stone Game（博弈）

原题连接：http://poj.org/problem?id=1740

A New Stone Game

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 6327		Accepted: 3455

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

题意：有N堆石子，两人轮流进行操作，每一次为“操作者指定一堆石子，先从中扔掉一部分（至少一颗，可以全部扔掉），然后可以将该堆剩下的石子中的任意多颗任意移到其他未取完的堆中”，操作者无法完成操作时为负。

 分析：
     只有一堆时先手必胜。
     有两堆时若两堆相等则后手只用和先手一样决策即可保证胜利，后手必胜。若不同则先手可以使其变成相等的两堆，先手必胜。
     有三堆时先手只用一次决策即可将其变成两堆相等的局面，先手必胜。
     有四堆时由于三堆必胜，无论先手后手都想逼对方取完其中一堆，而只有在四堆都为一颗时才会有人取完其中一堆，联系前面的结论可以发现，只有当四堆可以分成两两相等的两对时先手才会失败。                   

     分析到这里，题目好像已经有了一些眉目了，凭借归纳猜想，我们猜测必败态的条件为“堆数为偶数（不妨设为2N），并且可以分为两两相等的N对”。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 105;
int n;
int p[maxn];

int main(){
	while(~scanf("%d", &n)){
		memset(p, 0, sizeof(p));
		if(n == 0) break;
//		cout<<123<<endl;
		for(int i=0; i<n; i++){
			int temp;
			cin>>temp;
			p[temp]++;
		}
		int flag=0;
		if(n & 1){
			cout<<1<<endl;
			continue;
		}
		else {
			for(int i=1; i<=100; i++){
				if(p[i] & 1){
					cout<<1<<endl;
					flag = 1;
					break;
				}
			}
		}
		if(!flag) cout<<0<<endl;
	}
}