#include
#include
using namespace std;
//棋盘覆盖问题
int board[1025][1025];
static int tile = 1;
void ChessBoard(int tr, int tc, int dr, int dc, int size)
{
if (size == 1)//递归边界
{
return;
}
int t = tile++;//L型骨牌
int s = size / 2;//分割棋盘
if (dr < tr + s && dc < tc + s) //左上角子棋盘
//特殊方格在此棋盘中
ChessBoard(tr, tc, dr, dc, s);
else
{
//此棋盘中无特殊方格,用tile 号L型骨牌覆盖右下角
board[tr + s - 1][tc + s - 1] = t;
//覆盖其余方格
ChessBoard(tr, tc, tr + s - 1, tc + s - 1, s);
}
if (dr < tr + s && dc >= tc + s) //右上角子棋盘
//特殊方格在此棋盘中
ChessBoard(tr, tc + s, dr, dc, s);
else
{
//此棋盘中无特殊方格,用t号L型骨牌覆盖左下角
board[tr + s - 1][tc + s] = t;
//覆盖其余方格
ChessBoard(tr, tc + s, tr + s - 1, tc + s, s);
}
if (dr >= tr + s && dc < tc + s) //左下角子棋盘
//特殊方格在此棋盘中
ChessBoard(tr + s, tc, dr, dc, s);
else
{
//此棋盘中无特殊方格,用t号L型骨牌覆盖右上角
board[tr + s][tc + s - 1] = t;
ChessBoard(tr + s, tc, tr + s, tc + s - 1, s);
}
if (dr >= tr + s && dc >= tc + s) //右下角子棋盘
//特殊方格在此棋盘中
ChessBoard(tr + s, tc + s, dr, dc, s);
else
{
//此棋盘中无特殊方格,用t号L型骨牌覆盖左上角
board[tr + s][tc + s] = t;
//覆盖其余方格
ChessBoard(tr + s, tc + s, tr + s, tc + s, s);
}
}
int main()
{
int n, a, b,x,y, length, m;
//a,b是子棋盘左上角的行号和列号
//aa,bb是特殊点的行号和列号
cout << “请输入棋盘规模:”;
cin >> length;
cout << “请输入特殊点列号x:”;
cin >> x;
cout << “请输入特殊点行号y:”;
cin >> y;
a = b = 1;
m = length;
ChessBoard(a, b, y, x, length);
for (int i = 1; i <= m; i++) //输出
{
for (int j = 1; j <= m; j++)
{
cout.width(3);
cout << board[i][j];
if (j == m)
{
cout << endl;
}
}
}
}