See the tiered game for HDOJ 1730

Then there is a kind of intimacy, which is much simpler than SG ....

Consider the number of spaces between two pieces in the same row as the number of stones in a pile.

After a Nim operation, OK ....

# Include <iostream> # include <cmath> using namespace std; int main () {int N, M; while (scanf ("% d", & N, & M )! = EOF) {int xo = 0; int a, B; for (int I = 0; I <N; I ++) {scanf ("% d ", & a, & B); xo ^ = abs (a-B)-1);} printf ("% s", xo? "I WIN! \ N ":" bad luck! \ N ");}}