POJ Nim (2975)

最新推荐文章于 2020-03-06 08:51:55 发布

jjs98

最新推荐文章于 2020-03-06 08:51:55 发布

阅读量707

点赞数

分类专栏：博弈论文章标签：博弈论

本文链接：https://blog.csdn.net/pzler/article/details/23437251

版权

博弈论专栏收录该内容

9 篇文章 1 订阅

订阅专栏

Description

Nim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or more stones from any single pile. Play ends when all the stones have been removed, at which point the last player to have moved is declared the winner. Given a position in Nim, your task is to determine how many winning moves there are in that position.

A position in Nim is called “losing” if the first player to move from that position would lose if both sides played perfectly. A “winning move,” then, is a move that leaves the game in a losing position. There is a famous theorem that classifies all losing positions. Suppose a Nim position contains n piles having k₁, k₂, …, k_n stones respectively; in such a position, there are k₁ + k₂ + … + k_n possible moves. We write each k_i in binary (base 2). Then, the Nim position is losing if and only if, among all the k_i’s, there are an even number of 1’s in each digit position. In other words, the Nim position is losing if and only if the xor of the k_i’s is 0.

Consider the position with three piles given by k₁ = 7, k₂ = 11, and k₃ = 13. In binary, these values are as follows:

 111
1011
1101

There are an odd number of 1’s among the rightmost digits, so this position is not losing. However, suppose k₃ were changed to be 12. Then, there would be exactly two 1’s in each digit position, and thus, the Nim position would become losing. Since a winning move is any move that leaves the game in a losing position, it follows that removing one stone from the third pile is a winning move when k₁= 7, k₂ = 11, and k₃ = 13. In fact, there are exactly three winning moves from this position: namely removing one stone from any of the three piles.

Input

The input test file will contain multiple test cases, each of which begins with a line indicating the number of piles, 1 ≤ n ≤ 1000. On the next line, there are n positive integers, 1 ≤ k_i ≤ 1, 000, 000, 000, indicating the number of stones in each pile. The end-of-file is marked by a test case with n = 0 and should not be processed.

题目大意

Nim游戏，给定n堆石子，“你”为先手，如果你必输，输出0，否则输出一个方案数，表明总共有多少总策略可以保证自己必胜。

输入有多组数据，第一行为n（ 1 ≤ n ≤ 1000），表示有n堆石子。第二行有n个数表示刚开始时各个堆的石子数。

输入以n=0结束。

Output

For each test case, write a single line with an integer indicating the number of winning moves from the given Nim position.

Sample Input

3
7 11 13
2
1000000000 1000000000
0

Sample Output

3
0

题解

对于一个状态，要是它是先手必胜的，就一定满足从这个状态可以一步转成“先手必输”的状态。也就是说，我们要从n堆石子中的一堆取走一些石子，使剩下的石子数异或等于0.

我们可以从原石子堆中任选一堆，设其石子数为m。将剩下的石子异或起来，得到一个数x，只要x<m，就是一种必胜策略。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<cmath>
using namespace std;
int n,a[1002],ans;
void doit()
{
	int s,count=0;
	for(int i=1;i<=n;i++)
	   {s=ans^a[i];
	    if(s<a[i]) count++;
	   }
	printf("%d\n",count);
}
int main()
{
	while(scanf("%d",&n)&&n)
	   {ans=0;
		for(int i=1;i<=n;i++)
	       {scanf("%d",&a[i]);
		    ans=ans^a[i];
		   }
		if(ans==0) printf("0\n");
		else doit();
	   }
	return 0;
}