OpenJudge1413 Mondriaan's Dream

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int Tmax=15,Tmax2=2055;
int n,m,top;
long long int f[Tmax][Tmax2];
bool check(int s,int x)
{
int i,now=-1;
for(i=0;i<m;i++)
{
if((s&(1<<i))&&(x&(1<<i))) return false;
if((s&(1<<i))||(x&(1<<i))){
if((i-now-1)%2!=0) return false;
now=i;
}
}
if((m-now-1)%2!=0) return false;
return true;
}
void work()
{
int i,j,k;
for(i=1;i<=n;i++)
{
for(j=0;j<=top;j++)
{
if(f[i-1][j]==0) continue;
for(k=0;k<=top;k++)
if(check(j,k)) f[i][k]+=f[i-1][j];
}
}
printf("%lld\n",f
[0]);
return;
}
int main()
{
int i,j;
while(scanf("%d%d",&n,&m)==2&&n!=0)
{
if((n*m)%2!=0){
printf("0\n");
continue;
}
memset(f,0,sizeof(f));
f[0][0]=1;
top=(1<<m)-1;
work();
}
return 0;
}