poj 1740 A New Stone Game——取石子游戏（博弈论）

A New Stone Game

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 堆石子，两个人进行游戏，轮流操作。可以从一堆石子中拿走 k 颗石子（k >= 1)，或者是选择从一堆中选择 k 颗石子转移到其它的石碓上。最后一次拿光石子的人获胜。

题解： 首先讨论石头堆两堆两堆相等的情况,例如x,x,y,y,z,z.6堆的情况.在这种情况下先取的必输,很简单,先取的那人怎么取后取的那人就怎么取(如果对方把石头分配到一堆上,你就分配到与之对应的堆上),总之保持这个相等的均势不变,这样到最后,后取的人就将取走最后一堆石头.

知道这个结论后,就可以把N堆中两两相等的堆去掉,来讨论互不相等的堆来.

第一,只有一堆x,第一个人直接全部取走就胜利了.(显然x,y,y的情况也是第一人胜,所以忽略相等的石头);
第二,x,y的形式(这里不妨假设递增,下同).第一人从第二堆中取走(y-x)个石头,这样两堆相等,最终还是第一人胜;
第三,x,y,z的形式.第一人从最后一堆中取走(z+x-y)个石头,再将(y-x)个石头移到第一堆上(z>y-x一定成立),这样还是第一人胜.
依此类推,移动个数最多的石头堆然后再分配总可以前面变成两两相等的情况.可见只要开始不全是两两相等,那先取者必胜.

c++ AC 代码

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>

int arr[1010];

int main()
{
	int n;
	while(scanf("%d",&n) && n)
	{
		memset(arr,0,sizeof(arr));
		int a;
		int ans = 0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a);
			if(arr[a])
				ans--;
			else
				ans++;
			arr[a] = !arr[a];
		}
		if(ans)
			puts("1");
		else
			puts("0");
	}
	return 0;
}

文章参考自：https://blog.csdn.net/acm_zl/article/details/9429093