POJ 2234 Matches Game

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

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;
    int nums[25];
    while (SCF(N) != EOF)
    {
        FOR(i, 0, N)
            SCF(nums[i]);
        int ans = nums[0];
        FOR(i, 1, N)
        {
            ans = ans^nums[i];
        }
        if (ans == 0)
            printf("No\n");
        else
            printf("Yes\n");
    }
    return 0;
}