zoj 3084 S

#include <cstdio>#include <cstring>#include <algorithm>#define maxn 10005using namespace std;bool vis[105];int a[105],sg[maxn],n,m,k,ans;void getSG(){    for (int i=0; i<maxn; i++)    {        memset(vis,false,sizeof vis);        for (int j=1; j<=n && a[j]<=i; j++) vis[sg[i-a[j]]]=true;        for (int j=0; ; j++) if (!vis[j]) {     sg[i]=j;     break; }    }}int main(){    while (scanf("%d",&n) && n)    {        for (int i=1; i<=n; i++) scanf("%d",&a[i]);        sort(a+1,a+1+n);        getSG();        scanf("%d",&m);        while (m--)        { scanf("%d",&n); ans=0; while (n--) scanf("%d",&k),ans^=sg[k]; if (ans) printf("W");     else printf("L");        }        printf("n");    }    return 0;}