算法竞赛入门经典 8.3.1 棋盘覆盖问题

/*
 * 算法竞赛入门经典  8.3.1  棋盘覆盖问题
 * */

import java.util.Scanner;

public class ChessCover {
	public int step;
	public int[][] arr;

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int k, x, y;
		while ((k = scanner.nextInt()) > 0) {
			x = scanner.nextInt();
			y = scanner.nextInt();
			int n = 1 << k;
			ChessCover cc = new ChessCover();
			cc.step = 1;
			cc.arr = new int[n][n];
			cc.arr[x][y] = -1;
			cc.print();
			cc.dfs(0, 0, n);
		}
	}

	public void dfs(int x, int y, int n) {
		if (n == 1)
			return;
		boolean found = false;
		int i = 0, j = 0;
		for (i = x; i < x + n; i++) {
			for (j = y; j < y + n; j++) {
				if (arr[i][j] != 0) {
					found = true;
					break;
				}
			}
			if (found)
				break;
		}

		int dx = x + n / 2;
		int dy = y + n / 2;
		boolean xflag = i < dx;
		boolean yflag = j < dy;

		if (xflag) {
			arr[dx][dy - 1] = arr[dx][dy] = step;
			if (yflag)
				arr[dx - 1][dy] = step;
			else
				arr[dx - 1][dy - 1] = step;
		} else {
			arr[dx - 1][dy - 1] = arr[dx - 1][dy] = step;
			if (yflag)
				arr[dx][dy] = step;
			else
				arr[dx][dy - 1] = step;
		}
		print();
		step++;
		dfs(x, y, n / 2);
		dfs(x, y + n / 2, n / 2);
		dfs(x + n / 2, y, n / 2);
		dfs(x + n / 2, y + n / 2, n / 2);
	}

	public void print() {
		for (int i = 0; i < arr.length; i++) {
			for (int j = 0; j < arr[i].length; j++) {
				System.out.printf("%-3d", arr[i][j]);
			}
			System.out.println();
		}
		System.out.println();
	}
}