Farmer John has purchased a lush new rectangular pasture composed of M byN (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, some of the squares are infertile and can‘t be planted. Canny FJ knows that the cows dislike eating close to each other, so when choosing which squares to plant, he avoids choosing squares that are adjacent; no two chosen squares share an edge. He has not yet made the final choice as to which squares to plant.

Being a very open-minded man, Farmer John wants to consider all possible options for how to choose the squares for planting. He is so open-minded that he considers choosing no squares as a valid option! Please help Farmer John determine the number of ways he can choose the squares to plant.

1 2 3  4  

#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int n,m;int a[15][15],dp[15][1<<12],v[1<<12];const int mod = 100000000;void init(){    int i,l = 0;    for(i = 0; i<(1<<12); i++)    {        if((i & i<<1) == 0)//选出所有相邻不等的状态            v[l++] = i;    }}int check(int x,int p){    for(int i = 1; i<=m; i++)        if((p & 1<<(i-1)) && !a[x][i])//不能放的地方放了            return 1;    return 0;}int main(){    int i,j,k;    init();    while(~scanf("%d%d",&n,&m))    {        for(i = 1; i<=n; i++)            for(j = 1; j<=m; j++)                scanf("%d",&a[i][j]);        memset(dp,0,sizeof(dp));        for(i = 1; i<=n; i++)        {            for(j = 0; v[j]<(1<<m); j++)            {                if(check(i,v[j])) continue;                if(i == 1)                {                    dp[i][j] = 1;                    continue;                }                for(k = 0; v[k]<(1<<m); k++)                {                    if((v[j]&v[k]) == 0)//与上一行没有相邻的                        dp[i][j]+=dp[i-1][k];                }            }        }        __int64 ans = 0;        for(i = 0; v[i]<(1<<m); i++)            ans = (ans+dp[n][i])%mod;        printf("%I64d\n",ans);    }    return 0;}