蒟蒻求改

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;

int T; 
const int MAX=(1<<16);
int n;
int weapon[20];
int start;
ll d[MAX];
int beat[MAX];
char S[20];

int find(int s){
	if(beat[s]!=-1)return beat[s];
	int i;
	int ans=start;
	for(i=0;i<n;i++)
		if((1<<i)&s)
			ans|=weapon[i];
	return beat[s]=ans;
}

int read(){
	scanf("%s",S);
	//printf("%s\n",S);
	int ans=0;
	int i;
	for(i=0;i<n;i++)
		if(S[i]=='1')
			ans|=(1<<i);
	return ans;
}




int main(){
	freopen("Uva.in","r",stdin);
	scanf("%d",&T);
	int o;
	for(o=1;o<=T;o++){
		scanf("%d",&n);
		memset(beat,-1,sizeof(beat));
		memset(d,0,sizeof(d));
		memset(weapon,0,sizeof(weapon));
		int i,j;
		start=read();
		for(i=0;i<n;i++)
			weapon[i]=read();
		int all=(1<<n)-1;
		d[0]=1;
		for(i=1;i<=all;i++)
			for(j=0;j<n;j++)
				if(i&(1<<j)){
					int before=i^(1<<j);
					int w=find(before);
					if(w&(1<<j))
						d[i]+=d[before];
				}
		//for(i=0;i<n;i++)
		//	printf("%d ",weapon[i]);
		//printf("\n");
		//for(i=0;i<=all;i++)
		//	printf("%d\n",beat[i]);
		printf("Case %d: %lld\n",o,d[all]);
	}
	return 0;
}