ZOJ1100Mondriaan's Dream

用1*2的砖去恰好铺满n*m的地板

import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		new ZOJ1100().run();
	}

}

class ZOJ1100 {
	void run() {
		Scanner cin = new Scanner(new BufferedInputStream(System.in));
		PrintWriter cout = new PrintWriter(new BufferedOutputStream(System.out));
		int h, w;
		while (true) {
			h = cin.nextInt();
			w = cin.nextInt();
			if (h == 0 && w == 0)
				break;
			if (h < w) {
				int t = h;
				h = w;
				w = t;
			}
			List<State> states = new ArrayList<State>();
			dfs(0, 0, 0, states, w);
			for (int i = 0; i <= h; i++)
				Arrays.fill(dp[i], 0L);
			int limit = (1 << w) - 1;
			dp[0][limit] = 1L;
			for (int row = 0; row < h; row++) {
				for (State state : states) {
					dp[row + 1][state.to] += dp[row][state.from];
				}
			}
			cout.println(dp[h][limit]);
		}
		cout.flush();
	}

	void dfs(int pos, int from, int to, List<State> state, int w) {
		if (pos > w)
			return;
		if (pos == w) {
			state.add(new State(from, to));
			return;
		}
		dfs(pos + 2, from << 2 | 3, to << 2 | 3, state, w);
		dfs(pos + 1, from << 1 | 1, to << 1, state, w);
		dfs(pos + 1, from << 1, to << 1 | 1, state, w);
	}

	final int N = 11;
	long[][] dp = new long[N + 1][(1 << N) + 1];

}

class State {
	int from, to;

	State(int from, int to) {
		this.from = from;
		this.to = to;
	}
}