POJ 2975 Nim

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

Nim游戏。代码如下：

#include <iostream>
#include <math.h>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <string>
#include <sstream>
#include <cstring>
#include <queue>
#include <vector>
#include <functional>
#include <cmath>
#include <set>
#define SCF(a) scanf("%d", &a)
#define IN(a) cin>>a
#define FOR(i, a, b) for(int i=a;i<b;i++)
#define Infinity 999999999
#define NInfinity -999999999
#define PI 3.14159265358979323846
#define MAXN 1000000005
#define RATIO (sqrt(5.0)+1.0)/2.0
typedef long long Int;
using namespace std;

int main()
{
    int n;
    while (SCF(n))
    {
        if (!n)
            break;
        int *nums = new int[n];
        int cstate = 0;
        FOR(i, 0, n)
        {
            SCF(nums[i]);
            cstate = cstate^nums[i];
        }
        int fans = 0;
        FOR(i, 0, n)
        {
            if ((cstate ^ nums[i]) < nums[i])
            {
                fans++;
            }
        }
        printf("%d\n", fans);
        
    }
    return 0;
}