196_铺砖问题

铺砖问题，详见《挑战程序竞赛》第二版196页

//
//  196_brick.cpp
//  changlle
//
//  Created by user on 1/26/16.
//  Copyright (c) 2016 user. All rights reserved.
//

#include <iostream>
using namespace std;

int n=3;
int m=3;
const int MAX_M=10;
const int MAX_N=10;

bool color[MAX_N][MAX_M];
int dp[2][1<<MAX_N];

void solve() {
    int *crt=dp[0],*next=dp[1];
    crt[0]=1;
    
    for (int i=n-1;i>=0;i--) {
        for (int j=n-1;j>=0;j--){
            for (int used=0;used<1<<m;used++){
                if ((used>>j &1) || color[i][j]){
                    //不需要（i，j）放置砖块
                    next[used]=crt[used & ~(1<<j)];
                } else {
                    //尝试2种方法
                    int res=0;
                    //
                    if(j+1<m && !(used>>(j+1) &1) && !color[i][j+1])
                        res+=crt[used | 1<<(j+1)];
                    if(i+1 <n && !color[i+1][j])
                        res+=crt[used |1<<j];
                    
                    next[used]=res;
                }
            }
            swap(crt,next);
        }
    }
    cout<<crt[0]<<endl;
}



int main() {
    
    memset(color,0,sizeof(color));
    color[1][1]=true;
    solve();
}