HDU - 5119 DP

题意:求异或大于等于m的方案数
j枚举大了会WA..emmm

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#define rep(i,j,k) for(register int i=j;i<=k;i++)
#define rrep(i,j,k) for(register int i=j;i>=k;i--)
#define erep(i,u) for(register int i=head[u];~i;i=nxt[i])
#define iin(a) scanf("%d",&a)
#define lin(a) scanf("%lld",&a)
#define din(a) scanf("%lf",&a)
#define s0(a) scanf("%s",a)
#define s1(a) scanf("%s",a+1)
#define print(a) printf("%lld",(ll)a)
#define enter putchar('\n')
#define blank putchar(' ')
#define println(a) printf("%lld\n",(ll)a)
#define IOS ios::sync_with_stdio(0)
using namespace std;
const int maxn = (1<<20)+100;
const int oo = 0x3f3f3f3f;
const double eps = 1e-7;
typedef long long ll;
ll read(){
    ll x=0,f=1;register char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
ll dp[2][(1<<20)+555];
int a[6666];
int main(){
	int T=read(),kase=0;
	while(T--){
		int n=read();
		int m=read();
		int bit=0;
		
		rep(i,1,n){
			a[i]=read();
			bit=max(bit,(int)log2(a[i]));
		}bit++;
		memset(dp,0,sizeof dp);
		dp[0][0]=1;//note
		rep(i,1,n){
			rep(j,0,(1<<bit)-1){
				dp[i&1][j]=dp[i-1&1][j]+dp[i-1&1][j^a[i]];
			}
		}
		ll ans=0;
		rep(i,m,(1<<bit)-1) ans+=dp[n&1][i];
		printf("Case #%d: ",++kase);
		println(ans);
	}
	return 0;
}