样例输出8求条玄关

#include<bits/stdc++.h>
#define I_don_t_want_to_AFO int main()
#define I_want_to_study_OI_forever return 0;
using namespace std;
int m,n;
int vis[15][15];
int v[15];
int f[15][1<<12];
bool check(int s){
	return !(s&s>>1);
}
I_don_t_want_to_AFO{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin>>m>>n;
	for(int i=1;i<=n;i++){
		for(int j=0;j<m;j++){
			cin>>vis[i][j];
			v[i]+=(vis[i][j]<<j);
		}
	}
	f[0][0]=1;
	for(int i=1;i<=n+1;i++){
		for(int j=0;j<(1<<m);j++){
			if(!check(j)||((j&v[i])!=j))continue;
			for(int k=0;k<(1<<m);k++){
				if((j&k)==0&&check(k)&&((k&v[i-1])==k)){
					f[i][j]+=f[i-1][k];
					f[i][j]%=100000000;
				}
			}
		}
	}
	cout<<f[n+1][0];
	I_want_to_study_OI_forever
}