hdu 1536 (S-Nim) SG解法

#include <iostream>
#include <algorithm>
using namespace std;

int SG[10001];
int setNum;
int set[101];
int M,N;

int getSG(int value)
{
int i =0 ;
bool mex[101]={0};

for (i = 0 ; i < setNum ; i++)
{
int temp = value - set[i];

if (temp < 0)
break;
if (SG[temp] == -1)
SG[temp] = getSG(temp);
mex[SG[temp]] = true;
}

for (i = 0 ; ; i++)
if (!mex[i])
break;
return i;
}
int main()
{
int temp ;
while (cin>>setNum && setNum)
{
memset(SG,-1,sizeof(SG));
SG[0]=0;

for(int i =0 ; i < setNum ; i++)
{
cin>>set[i];
}
sort(set,set+setNum);

cin>>M;
while(M--)
{
int ans =0 ;
cin>>N;
for (int i =0 ; i < N ; i++)
{
cin>>temp;
if(SG[temp] == -1)
SG[temp] = getSG(temp);

ans^=SG[temp];
}
if (ans)
cout<<"W";
else
cout<<"L";
}
cout<<endl;
}
return 0;
}