11892-enimen (game)

Ultraviolet A 11892-enimen

Question Link

Given n piles of stones, the two can take turns. One or more piles of stones can be taken at a time, then the next person must continue to take the heap, win the last stone, and ask who wins.

Train of Thought: Simply put, the latter hand may only win if the heap number is even and the number is 1.

Code:

#include <stdio.h>#include <string.h>const int N = 20005;int t, n, a[N];bool judge() {if (n % 2) return false;for (int i = 0; i < n; i++)if (a[i] != 1) return false;return true;}int main() {scanf("%d", &t);while (t--) {scanf("%d", &n);for (int i = 0; i < n; i++)scanf("%d", &a[i]);if (judge()) printf("piloop\n");else printf("poopi\n"); }return 0;}