山东省第八届acm省赛A题 博弈

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<queue>#include<vector>#include<stack>#include<map>#include<cmath>using namespace std;typedef long long ll;const int maxn=1e5+5;int a[maxn];int main(){    int t,n,i;    scanf("%d",&t);    while(t--&&scanf("%d",&n)!=EOF)    {        for(int i=0;i<n;++i)            scanf("%d",a+i);        if(n==2)        {            if(a[0]>a[1])                swap(a[0],a[1]);            if((int)((a[1]-a[0])*(sqrt(5)+1)/2)!=a[0])                printf("Sherlock\n");            else                printf("Watson\n");        }        else        {            int flag=a[0];            for(int i=1;i<n;++i)                flag^=a[i];            if(flag)                printf("Sherlock\n");            else                printf("Watson\n");        }    }    return 0;}