poj 2975 Nim

Nim

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4659		Accepted: 2164

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.

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

Source

Stanford Local 2005

win position就是每次从某一堆哪任意石子后，之后的是一个必败局面。所以题目让求解的就是第一次移动必胜的方案数。

我们由nim游戏知道，x^=a[i],当x!=0时，是必胜。所以，假如x^a[k]<=a[k],那么a[k]一定可以通过减少一些石子使得a[k]==x^a[k],从而使得x‘==0,即必败局面。

#include <iostream>
#include <cstdio>

using namespace std;

int a[1001];

int main()
{
    int n;
    while(~scanf("%d",&n)){
        if(n==0) break;
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        int x=0;
        for(int i=0;i<n;i++)
            x^=a[i];
        if(x==0) printf("0\n");
        else {
            int sum=0;
            for(int i=0;i<n;i++)
                if((x^a[i])<=a[i]) sum++;
            printf("%d\n",sum);
        }
    }

    return 0;
}