棋盘覆盖算法

#include<iostream>
#include<cmath>
using namespace std;
int tile = 1;
void ChessBoard(int* (*Board), int tr, int tc, int dr, int dc, int size)
{
	if (size == 1)
	{
		return;
	}
	int t = tile++;
	int s = size / 2;
	if (dr < tr + s && dc < tc + s)
	{
		ChessBoard(Board, tr, tc, dr, dc, s);
	}
	else
	{
		Board[tr + s - 1][tc + s - 1] = t;
		ChessBoard(Board, tr, tc, tr + s - 1, tc + s - 1, s);
	}
	if (dr < tr + s && dc >= tc + s)
	{
		ChessBoard(Board, tr, tc + s, dr, dc, s);
	}
	else
	{
		Board[tr + s - 1][tc + s] = t;
		ChessBoard(Board, tr, tc + s, tr + s - 1, tc + s, s);
	}
	if (dr >= tr + s && dc < tc + s)
	{
		ChessBoard(Board, tr + s, tc, dr, dc, s);
	}
	else
	{
		Board[tr + s][tc + s - 1] = t;
		ChessBoard(Board, tr + s, tc, tr + s, tc + s - 1, s);
	}
	if (dr >= tr + s && dc >= tc + s)
	{
		ChessBoard(Board, tr + s, tc + s, dr, dc, s);
	}
	else
	{
		Board[tr + s][tc + s] = t;
		ChessBoard(Board, tr + s, tc + s, tr + s, tc + s, s);
	}
}
int main()
{
	int k = 0;
	int dr = 0, dc = 0;
	int* (*Board) = NULL;
	cout << "请输入棋盘大小：";
	cin >> k;
	k = pow(2.0, k);
	Board = new int* [k];
	for (int i = 0; i < k; i++)
	{
		Board+ = new int[k];
	}
	cout << "请输入特殊方格的列号："<<endl;
	cin >> dc;
	cin >> dr;
	Board[dr - 1][dc - 1] = 0;
	ChessBoard(Board, 0, 0, dr - 1, dc - 1, k);
	for (int m = 0; m < k; m++)
	{
		for (int n = 0; n < k; n++)
		{
			cout << '\t' << Board[m][n];
		}
		cout << endl;
	}
	return 0;
}