POJ-2975 Nim ----数学--Nim博弈

Nim POJ-2975

添加链接描述
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
题意：求Nim博弈有多少种获胜的方法
解题思路：用Nim博弈的公式

nim=?1 ⊕ ?2 ⊕ ?3 ⊕ … ⊕ ?n=0<==>必败

AC代码：
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
#define maxn 1000000007
typedef long long ll;
int main()
{
    int n,a[1005];
    while(scanf("%d",&n)==1&&n)
    {
        int ans=0,k=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            k=k^a[i];   //求n个数的Nim和
        }
        for(int i=0;i<n;i++)
        {
            if((k^a[i])<a[i])   //从前往后逐一判断，k⊕a[i]相当于在n个数中去掉a[i],如果(k⊕a[i])<a[i]，则可以在第i堆石头里
               ans++;           拿走a[i]-(k⊕a[i])个石头，使(k⊕a[i])==a[i](减少后的a[i])<==>k⊕a[i]⊕a[i]=0从而使对方状态的
        }                       Nim和为0，这样对方必败
        printf("%d\n",ans);
    }
    return 0;
}

如果有疑问欢迎大家留言( •̀ ω •́ )✧