Source Code

 Problem:         User: sdfzyhy

 Memory: 444K        Time: 313MS

 Language: G++        Result: Accepted

     Source Code

     //POJ 2960

     #include<cstdio>

     #include<cstring>

     #define F(i,j,n) for(int i=j;i<=n;++i)

     int getint(){

         int v=,sign=; char ch=getchar();

         while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

         while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

         return v*=sign;

     }

     const int N=;

     /******************tamplate*********************/

     int f[N],s[];

     bool mark[N];

     void calsg(int n){

         f[]=;

         F(i,,){

             memset(mark,,sizeof mark);

             F(j,,n) if (i-s[j]>=)

                 mark[f[i-s[j]]]=;

             F(j,,i) if(!mark[j]){ f[i]=j;break;}

         }

     }

     int main(){

         int n,m,k;

         while(scanf("%d",&n)!=EOF && n){

             F(i,,n) s[i]=getint();

             m=getint();

             calsg(n);

             F(i,,m){

                 k=getint();

                 int ans=;

                 F(j,,k) ans^=f[getint()];

                 printf(ans ? "W" : "L");

             }

             printf("\n");

         }

         return ;

     }