UVA 12113 - Overlapping Squares

#include 
#include 
#include 
#include 
#include 
using namespace std;
const int maxn = (1<<9);
int a[9][8]={{1,3,9,13,18,19,21,22}};
int clean[9][4]={{10,11,12,20}};
void init(){
 int kk=1;
    for(int d = 0 ;d<=2;d++)
      for(int l = 0;l<=2;l++)if(d||l){
           //cout< 6 || 8*n>i)&1)
            b[k++] = i;

         do{
          memset(c,0,sizeof(c));
          int cnt=0;
          for(int i=0;i

你可能感兴趣的:(暴力搜索)