POJ-2975-Nim（Nim博弈）

链接：http://poj.org/problem?id=2975

Language: Default Nim Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5379   Accepted: 2520 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 k1, k2, …, kn stones respectively; in such a position, there are k1 + k2 + … + kn possible moves. We write each ki in binary (base 2). Then, the Nim position is losing if and only if, among all the ki’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 ki’s is 0. Consider the position with three piles given by k1 = 7, k2 = 11, and k3 = 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 k3 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 k1 = 7, k2 = 11, and k3 = 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 ≤ ki ≤ 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

题解：

基础Nim博弈问题，求first choice的方案数目

已知当前是P-position时，有a[1]^a[2]^...^a[n]=0，那么对于一个N-position，有a[1]^a[2]^...^a[n]!=0；

那么本题就是对于当前position，求其对应的N-position方案数

即转换为a[1]^a[2]^...^a[i]^...^a[n]^a[i]<a[i]，

显然a[1]^a[2]^...^a[i]^...^a[n]^a[i]为某一堆被选后剩余数量，必然小于a[i]。

//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int Scan()
{
    int res=0,ch,flag=0;
    if((ch=getchar())=='-')flag=1;
    else if(ch>='0'&&ch<='9')res=ch-'0';
    while((ch=getchar())>='0'&&ch<='9')res=res*10+ch-'0';
    return flag?-res:res;
}
void Out(int a)
{
    if(a>9)Out(a/10);
    putchar(a%10+'0');
}
#define INF 0x3f3f3f3f
#define bug cout<<"bug"<<endl
const int MAXN = 1e4+7;
int a[MAXN];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(!n)break;
        int temp=0,ans=0;
        for(int i=0; i<n; ++i)
        {
            a[i]=Scan();
            temp^=a[i];
        }
        for(int i=0; i<n; ++i)
            if((temp^a[i])<a[i])
            ans++;
        Out(ans),putchar('\n');
    }
    return 0;
}