算法3.8 棋盘覆盖问题的分治算法

//棋盘覆盖问题
#include<iostream>
#include<iomanip>
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++;
	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,dr,dc,s);
	else 
	{
		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 
	{
		board[tr+s][tc+s]=t;
		ChessBoard(tr+s,tc+s,tr+s,tc+s,s);
	}
}

int main()
{
	int i,j;
	int k;
	while(cin>>k)
	{
		int size = 1<<k;
		int x,y;  
		cin>>x>>y;  
		board[x][y]=0;
		ChessBoard(0, 0, x, y, size);
		for(i=0; i<size; i++)
		{
			for(j = 0; j < size; j++)
			   cout<< board[i][j]<<"\t";
			cout<<"\n";
		}
	}
	return 0;
}