Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller.
Actually, Yi Sima was playing it different. First of all, he tried to generate a 4×4 board with every row contains 1 to 4, every column contains 1 to 4. Also he made sure that if we cut the board into four 2×2 pieces, every piece contains 1 to 4.
Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover.
Actually, you are seeing this because you've passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!
Actually, Yi Sima was playing it different. First of all, he tried to generate a 4×4 board with every row contains 1 to 4, every column contains 1 to 4. Also he made sure that if we cut the board into four 2×2 pieces, every piece contains 1 to 4.
Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover.
Actually, you are seeing this because you've passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!
It's guaranteed that there will be exactly one way to recover the board.
3 **** 2341 4123 3214 *243 *312 *421 *134 *41* **3* 2*41 4*2*
Case #1: 1432 2341 4123 3214 Case #2: 1243 4312 3421 2134 Case #3: 3412 1234 2341 4123
数独模板留着以后用
#include<iostream>
#include<cstdio>
using namespace std;
char str[5][5];
int num[4][4];
bool flag;
bool check(int n, int key){
int x = n / 4, y = n % 4;
for(int i = 0; i < 4; i++){
if(num[x][i]==key || num[i][y]==key)
return false;
}
int x2 = x / 2 * 2, y2 = y / 2 * 2;
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
if(num[x2+i][y2+j] == key)
return false;
return true;
}
void dfs(int n){
int x = n / 4, y = n % 4;
if(n>15){
flag = true;
return;
}
if(num[x][y] != 0)
dfs(n+1);
else{
for(int i=1; i<=4; i++){
if(check(n, i)){
num[x][y] = i;
dfs(n+1);
if(flag == true)
return;
num[x][y] = 0;
}
}
}
}
int main(){
int T;
scanf("%d",&T);
for(int ca = 1; ca <= T; ca++){
flag = false;
for(int i = 0; i < 4; i++)
scanf("%s", str[i]);
for(int i = 0; i < 4; i++)
for(int j = 0; j < 4; j++)
if(str[i][j] =='*')
num[i][j] = 0;
else
num[i][j] = str[i][j] - '0';
/*for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++)
printf("%d", num[i][j]);
puts("");
}
*/
dfs(0);
printf("Case #%d:\n", ca);
for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++)
printf("%d", num[i][j]);
puts("");
}
}
}