hdu 1979 剪枝暴搜

Fill the blanks

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 283    Accepted Submission(s): 115

Problem Description

There is a matrix of 4*4, you should fill it with digits 0 – 9, and you should follow the rules in the following picture:

 

Input

No input.

 

Output

Print all the matrixs that fits the rules in the picture. 
And there is a blank line between the every two matrixs.

 

Sample Output

1193

1009

9221

3191

 

1193

1021

9029

3911

……

9173

1559

3821

3391

 

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 using namespace std;

 bool flag[],mark;
 int map[][];

 void get_primes()
 {
     memset(flag,,sizeof(flag));
     int i,j;flag[]=flag[]=;
     for(i=;i<;i++)
     {
         for(j=i+i;j<;j+=i)
             flag[j]=;
     }
 }
 bool cjudge(int x)
 {
     int i,a=,b=;
     for(i=;i<;i++) a=a*+map[x][i];
     for(i=;i>=;i--) b=b*+map[x][i];
     if(flag[a]&&flag[b]) return true;
     return false;
 }
 bool rjudge(int x)
 {
     int i,a=,b=;
     for(i=;i<;i++) a=a*+map[i][x];
     for(i=;i>=;i--) b=b*+map[i][x];
     if(flag[a]&&flag[b]) return true;
     return false;
 }
 bool ljudge()
 {
     int i,a=,b=;
     for(i=;i<=;i++) a=a*+map[i][-i];
     for(i=;i>=;i--) b=b*+map[i][-i];
     if(flag[a]&&flag[b]) return true;
     return false;
 }
 bool rjudge()
 {
     int i,a=,b=;
     for(i=;i<=;i++) a=a*+map[i][i];
     for(i=;i>=;i--) b=b*+map[i][i];
     if(flag[a]&&flag[b]) return true;
     return false;
 }
 void Printf()
 {
     for(int i=;i<;i++)
     {
         for(int j=;j<;j++)
             printf("%d",map[i][j]);
         printf("\n");
     }
 }

 void dfs(int i,int j)
 {
     if(i==)
     {
         if(mark++) puts("");
         Printf();
         return ;
     }
     for(int k=;k<;k++)
     {
         if(k%== && (i==||i==||j==||j==)) continue;
         map[i][j]=k;
         if(j== && !cjudge(i)) continue;
         if(i== && !rjudge(j)) continue;
         if(i== && j== && !ljudge()) continue;
         if(i== && j== && !rjudge()) continue;
         dfs(i+(j+)/,(j+)%);
     }
 }

 int main()
 {
     get_primes();
     mark=;
     dfs(,);
     return ;
 }