HDU5011-Game (game)

Question Link

Question: In the stone game, two people take turns to take the stones. There are rules for taking the stones. Either drop the stones, or divide the stones into two heaps, if you fail.

Idea: In a simple Nim game, when all values are different or 0, the first hand fails.

Code:

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int MAXN = 100005;int arr[MAXN];int main() {    int n;    while (scanf("%d", &n) != EOF) {        for (int i = 0; i < n; i++)             scanf("%d", &arr[i]);        int sum = 0;           for (int i = 0; i < n; i++)            sum ^= arr[i];        if (sum == 0)            printf("Lose\n");        else            printf("Win\n");    }    return 0;}

HDU5011-Game (game)