UVA - 11892 ENimEN

博弈

很简单，我都没看懂意思，，，猜的样例

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include <map>
#include <set>
#include <queue>
#include <vector>
#define mod  1000000007
#define INF  0x3f3f3f3f3f

using namespace std;
typedef long long ll;
const int maxn = 20000 + 7;
int T, n;
ll a[maxn];

int main() {
    scanf("%d", &T);
    
    while(T--) {
        int f = 0;
        scanf("%d", &n);
        ll sum = 0, x;
        for(int i = 0; i < n; ++i) {
            cin >> x, sum += x;
            if(x > (ll)1) f = 1;
        }
        if(f || (!f && n&1)) cout << "poopi" << endl;
        else cout << "piloop" << endl;
    }

    return 0;
}