HDU 5011 Game (Xi'an cyber competition E), hdu5011

HDU 5011 Game (Xi'an cyber competition E), hdu5011
HDU 5011 Game

Question Link

Idea: in fact, just ask for a Nim sum, and it is not difficult to push it. The sum of 0 must be a winning state, because at least one is taken away and the score cannot reach the original value, if it is a non-zero value, it is the same as the original Nim, so that it can take a bunch of numbers to make it 0.

Code:

# Include <cstdio> # include <cstring> const int N = 100005; int n; long a, sum; int main () {while (~ Scanf ("% d", & n) {sum = 0; for (int I = 0; I <n; I ++) {scanf ("% I64d ", & a); sum ^ = a;} if (sum = 0) printf ("Lose \ n"); else printf ("Win \ n ");} return 0 ;}