bzoj1874 取石子游戏

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=15,maxa=1010;
int vis[maxn],sg[maxa],a[maxn],b[maxn],n,m,mx;
int main()
{
int res=0;
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
mx=max(mx,a[i]);
}
scanf("%d",&m);
for (int i=1;i<=m;i++) scanf("%d",&b[i]);
for (int i=1;i<=mx;i++)
{
for (int j=0;j<=m;j++) vis[j]=0;
for (int j=1;j<=m&&i>=b[j];j++) vis[sg[i-b[j]]]=1;
for (int j=0;;j++)
if (!vis[j])
{
sg[i]=j;
break;
}
}
for (int i=1;i<=n;i++) res^=sg[a[i]];
if (res)
{
printf("YES\n");
for (int i=1;;i++)
for (int j=1;j<=m&&a[i]>=b[j];j++)
if (sg[a[i]-b[j]]==(res^sg[a[i]]))
{
printf("%d %d\n",i,b[j]);
return 0;
}
}
else printf("NO\n");
}