数字覆盖.cpp

来自「里面包含vc的经典算法,如动态规划,分治,回溯,贪心算法等」· C++ 代码 · 共 62 行

#include<iostream>
#include<string>
#include <stdlib.h>
#include <iomanip>
#define n 4

using namespace std;

int board[n][n];
int tile;
//int s=0;
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()
{   tile=0;
  for(int i=0;i<n;i++)
	  for(int j=0;j<n;j++)
		  board[i][j]=0;
     chessboard(0,0,0,1,n);
	 cout<<tile<<endl;
    for( i=0;i<n;i++)
	{ for(int k=0;k<n;k++)
		  cout<<setw(3)<<board[i][k];
       cout<<endl;
	   }
	return 0;
}