因为
A
和
于是可以dp,
dp[i][j][0/1]
表示选完了
1..i
的数,异或和为
j
且
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=2100,p=1000000007;
int inc(int x,int y)
{
x+=y;
return x>=p?x-p:x;
}
int dp[2][maxn][2],n,m,lim;
int main()
{
int ans=0,mx,x;
scanf("%d%d",&n,&m);
mx=max(n,m);
while ((1<<lim)<=n||(1<<lim)<=m) lim++;
lim=(1<<lim)-1;
for (int i=0;(1<<i)<=lim;i++)
{
memset(dp[0],0,sizeof(dp[0]));
dp[0][0][0]=1;
for (int j=1,c=1;j<=mx;j++,c^=1)
{
x=(j>>i)&1;
for (int k=0;k<=lim;k++)
for (int X=0;X<=1;X++)
{
dp[c][k][X]=dp[c^1][k][X];
if (j<=n) dp[c][k][X]=inc(dp[c][k][X],dp[c^1][k^j][X]);
if (j<=m) dp[c][k][X]=inc(dp[c][k][X],dp[c^1][k^j][X^x]);
}
}
for (int j=(1<<i);j<(1<<(i+1));j++) ans=inc(ans,dp[mx&1][j][1]);
}
printf("%d\n",ans);
}