poj2411Mondriaan's Dream<DP>

链接:http://poj.org/problem?id=2411

#include<cstdio>
#include<string.h>
long long f[2][4100],a,b,n,m,k,j,p;
int main(){
   while(scanf("%d%d",&n,&m), n+m){
        if( (n*m)&1 ){
            puts( "0" );
            continue;
        }
        memset(f,0,sizeof(f));
        f[0][0]=p=1,a=n>m?n:m,b=n+m-a ;
          for( int i=0; i<a; ++ i ){
            for(j=0;++j<=b;){
                for(k=(1<<b);--k+1;)
                  if(k&1<<j-1)
                     f[p][k&~(1<<j-1)]+=f[1-p][k];
                  else{
                       f[p][k|1<<j-1]+=f[1-p][k];
                       if(j<b&&!(k&1<<j))
                          f[p][k|1<<j]+=f[1-p][k];
              }
              memset(f[p=1-p],0,sizeof(f[p]));    
            }
          }
      printf("%lld\n",f[1-p][0]);
   }
}

#include <iostream>
 #include <cstring>
 #include <cstdio>
 using namespace std;
 int n,m;
 long long add;
 long long dp[2][1<<12];
 void dfs(int i,int s,int cur)
 {
     if(cur==m) {dp[i][s]+=add;return;}
     dfs(i,s,cur+1);
     if(cur<m-1&&!(s&1<<cur)&&!(s&1<<(cur+1)))
         dfs(i,s|1<<cur|1<<(cur+1),cur+2);
 }
 int main()
 {
     while(scanf("%d%d",&n,&m),n+m)
     {
         if(n*m%2) {printf("0\n");continue;}
         int rt=(1<<m)-1;
         add=1;
         memset(dp,0,sizeof(dp));
         dfs(0,0,0);
         for(int i=1;i<n;i++)
         {
             memset(dp[i%2],0,sizeof(dp[1]));
             for(int j=0;j<=rt;j++) if(dp[(i-1)%2][j])
             {
                 add=dp[(i-1)%2][j];
                 dfs(i%2,~j&rt,0);
             }
         }
         printf("%I64d\n",dp[(n-1)%2][rt]);
     }
     return 0;
 }