在一个2^k * 2k(k为正整数,k<=10,length=2k)个方格组成的棋盘中,恰有一个方格与其他方格不同,称该方格为一特殊方格(其坐标为aa,bb,分别代表行坐标号和列坐标号),以及有四种L型骨牌(如下图)。求用若干块这种L型骨牌实现除该特殊点棋盘的全覆盖。
#include<iostream>
using namespace std;
int tile=1;
int board[99][99];
void chessBoard ( int tr, int tc, int dr, int dc, int size )
{
if ( size==1 ) //边界(棋盘方格大小为1)
return;
int t=tile++; //每次递增1
int s=size/2; //棋盘中间的行、列
//检查特殊方块是否在左上角子棋盘中
if ( dr<tr+s && dc<tc+s ) //在
chessBoard ( tr, tc, dr, dc, s );
else //不在,将该子棋盘右下角的方块视为特殊方块
{
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 //左下角的方块视为
{
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+s, dr, dc, s );
else //左上角的方块视为
{
board[tr+s][tc+s]=t;
chessBoard ( tr+s, tc+s, tr+s, tc+s, s );
}
//左下角
if ( dr>=tr+s && dc<tc+s )
chessBoard ( tr+s, tc, dr, dc, s );
else //右上角的方块视为
{
board[tr+s][tc+s-1]=t;
chessBoard ( tr+s, tc, tr+s, tc+s-1, s );
}
}
int main()
{
int x,y,length;
cin>>x;
cin>>y;
cin>>length;
for(int k1=0; k1<99; k1++)
{
for(int k2=0; k2<99; k2++)
{
board[k1][k2] = 0;
}
}
chessBoard ( 0,0,x-1,y-1,length ); //下标从0开始
for ( int i=0; i<length; i++ )
{
for ( int j=0; j<length; j++ )
printf("%4d",board[i][j]);
cout<<endl;
}
return 0;
}