hdu5119 DP

#include<stdio.h>
#include<string.h>
#define ll long long
const int maxn = 1000000;
ll dp[50][maxn];
int m,n;
int a[50],ff;
void slove()
{
int i,j;
for(i=2;i<=n;i++)
{
for(j=0;j<maxn;j++)
dp[i][j]+=dp[i-1][j];
for(j=0;j<maxn;j++)
{
dp[i][j^a[i]]+=dp[i-1][j];
}
}
ll ans=0;
for(i=m;i<maxn;i++)
ans+=dp
[i];
printf("Case #%d: %lld\n",++ff,ans);
}
int main()
{
int i,j,t;
ff=0;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
memset(dp,0,sizeof(dp));
dp[1][0]=dp[1][a[1]]=1;
slove();
}
}