POJ 2411 Mondriaan's Dream 状态DP

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<sstream>
#include<cmath>
#include<climits>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define pb(a) push_back(a)
#define INF 0x1f1f1f1f
#define lson idx<<1,l,mid
#define rson idx<<1|1,mid+1,r
#define PI  3.1415926535898
template<class T> T min(const T& a,const T& b,const T& c) {
    return min(min(a,b),min(a,c));
}
template<class T> T max(const T& a,const T& b,const T& c) {
    return max(max(a,b),max(a,c));
}
void debug() {
#ifdef ONLINE_JUDGE
#else

    freopen("d:\\in.txt","r",stdin);
   // freopen("d:\\out1.txt","w",stdout);
#endif
}
int getch() {
    int ch;
    while((ch=getchar())!=EOF) {
        if(ch!=' '&&ch!='\n')return ch;
    }
    return EOF;
}
ll dp[11][1<<11];
int check[1<<11];

int init()
{
    for(int st=0;st<(1<<11);st++)
    {
        check[st]=1;
        int num=0;
        for(int k=0;k<=11;k++)
        {
            if(st&(1<<k))
            {
                num++;

            }else
            {
                if(num%2==1)
                {
                    check[st]=0;
                    break;
                }
                num=0;
            }
        }
    }
    return 0;
}
int main()
{
    init();
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF&&(m||n))
    {
        memset(dp,0,sizeof(dp));
        for(int st=0;st<(1<<m);st++)if(check[st])
            dp[0][st]=1;
        for(int i=1;i<n;i++)
        {
            for(int st=0;st<(1<<m);st++)if(dp[i-1][st])
            {
                for(int st2=st;st2>=0;st2=st&(st2-1))if(check[st2])
                {
                    dp[i][st2|((~st)&((1<<m)-1))]+=dp[i-1][st];
                    if(st2==0)break;
                }

            }
        }
        printf("%I64d\n",dp[n-1][(1<<m)-1]);
    }
    return 0;
}