[BZOJ1982][Spoj 2021]Moving Pebbles（博弈）

题目描述

传送门

题解

同PKU New Stone Game

代码

#include<algorithm>#include<iostream>#include<cstring>#include<cstdio>using namespace std;#define N 100005int n;int a[N];int main(){    while (~scanf("%d",&n))    {        for (int i=1;i<=n;++i) scanf("%d",&a[i]);        if (n%2) {puts("first player");continue;}        sort(a+1,a+n+1);        bool flag=true;        for (int i=2;i<=n;i+=2)            if (a[i]!=a[i-1]) {flag=false;break;}        if (flag) puts("second player");        else puts("first player");    }    return 0;}