残缺棋盘

#include<iostream>
#include<iomanip>
using namespace std;
int tile=0,* (* B);

void tileboard(int tr,int tc,int dr,int dc,int size){
	int t,s;
	if(size==1)	return;
	t=++tile;
	s=size/2;

	if((dr<tr+s)&&(dc<tc+s))
		tileboard(tr,tc,dr,dc,s);
	else{ 
		B[tr+s-1][tc+s-1]=t;
		tileboard(tr,tc,tr+s-1,tc+s-1,s);
	}

	if((dr<tr+s)&&(dc>=tc+s))
		tileboard(tr,tc+s,dr,dc,s);
	else{
		B[tr+s-1][tc+s]=t;
		tileboard(tr,tc+s,tr+s-1,tc+s,s);
	}

	if((dr>=tr+s)&&(dc<tc+s))
		tileboard(tr+s,tc,dr,dc,s);
	else{
		B[tr+s][tc+s-1]=t;
		tileboard(tr+s,tc,tr+s,tc+s-1,s);
	}

	if((dr>=tr+s)&&(dc>=tc+s))
		tileboard(tr+s,tc+s,dr,dc,s);
	else{
		B[tr+s][tc+s]=t;
		tileboard(tr+s,tc+s,tr+s,tc+s,s);
	}
}

int main(){
	int x,y,n;
	cout<<endl<<"请输入残缺方格所在的行号、列号、棋盘行列数非别为：";
	cin>>x>>y>>n;

	B=new int *[n];  //动态创建数组
	for(int i=0;i<n;i++) 
		B[i]=new int[n]; 

	B[x][y]=tile;//赋给残缺棋盘的值为0
	tileboard(0,0,x,y,n);//棋盘覆盖算法

	for(i=0;i<n;i++){  //输出结果
		for(int j=0;j<n;j++)
			cout<<setw(4)<<B[i][j];
		cout<<endl;
	}
	return 0;
}