poj 2411

状压DP，以前这题TLE，改了好久才改好（还不如重写QAQ）

//#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define inf 1e9
#define ll long long
#define succ(x) (1<<x)
#define NM 13
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
ll d[NM+1][succ(NM)];
int n,m,x,s;
bool c[succ(NM)];
bool check(int x,int y){
    return (x|y)==s&&c[x&y];
}
int main(){
    n=succ(13)-1;
    inc(i,0,n){
        x=0;c[i]=true;
        inc(j,0,12)
        if(i&succ(j))x++;
        else{
            if(x%2)c[i]=false;
            x=0;
        }
    }
    while(1){
        n=read();m=read();
        if(n==0||m==0)break;
        if(n>m)swap(n,m);
        mem(d);
        s=succ(n)-1;
        inc(t,0,s){
            d[1][t]=c[t];
//            printf("%d ",d[1][t]);
        }
//        printf("
");
        inc(i,2,m){
        inc(t,0,s){
            inc(v,0,s)
            if(check(t,v))
            d[i][t]+=d[i-1][v];
//            printf("%d ",d[i][t]);
        }
//        printf("
");
    }
        printf("%lld
",d[m][s]);
    }
    return 0;
}