我现在做的是第二专题编号为1026的试题,具体内容如下所示:
Sudoku Killer
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 32 Accepted Submission(s) : 9
7 1 2 ? 6 ? 3 5 8<br>? 6 5 2 ? 7 1 ? 4<br>? ? 8 5 1 3 6 7 2<br>9 2 4 ? 5 6 ? 3 7<br>5 ? 6 ? ? ? 2 4 1<br>1 ? 3 7 2 ? 9 ? 5<br>? ? 1 9 7 5 4 8 6<br>6 ? 7 8 3 ? 5 1 9<br>8 5 9 ? 4 ? ? 2 3<br>
7 1 2 4 6 9 3 5 8<br>3 6 5 2 8 7 1 9 4<br>4 9 8 5 1 3 6 7 2<br>9 2 4 1 5 6 8 3 7<br>5 7 6 3 9 8 2 4 1<br>1 8 3 7 2 4 9 6 5<br>2 3 1 9 7 5 4 8 6<br>6 4 7 8 3 2 5 1 9<br>8 5 9 6 4 1 7 2 3<br>
解题思路:
用深度搜索dfs,每个数都会影响该行、该列、该小九宫格,一直深搜至到填满。因为有唯一解,对所有可能进行搜索即可。
编写代码:
#include<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
char map[10][10];
int mm[10][10];
typedef struct S {
int x, y;
} GOOD;
GOOD good[100];
char s[25];
int row[10][10], col[10][10], blo[10][10];
int cnt;
int dfs(int now) {
if (now == cnt)
return 1;
int block, xx, yy, t;
xx = good[now].x;
yy = good[now].y;
block = (xx / 3)*3 + yy / 3;
for (t = 1; t <= 9; ++t) {
if (row[xx][t] == 0 && col[yy][t] == 0 && blo[block][t] == 0) {
mm[xx][yy] = t;
row[xx][t] = 1;
col[yy][t] = 1;
blo[block][t] = 1;
if (dfs(now + 1))
return 1;
row[xx][t] = 0;
col[yy][t] = 0;
blo[block][t] = 0;
}
}
return 0;
}
int main() {
int i, j;
int first = 1;
while (scanf("%s", s) != EOF) {
if (first)
first = 0;
else
printf("\n");
memset(row, 0, sizeof (row));
memset(col, 0, sizeof (col));
memset(blo, 0, sizeof (blo));
cnt = 0;
i = 0;
j = 0;
if (s[0] == '?') {
good[cnt].x = i;
good[cnt].y = j;
++cnt;
} else {
mm[i][j] = s[0] - '0';
row[i][mm[i][j]] = 1;
col[j][mm[i][j]] = 1;
blo[(i / 3)*3 + j / 3][mm[i][j]] = 1;
}
for (i = 0; i < 9; ++i) {
for (j = 0; j < 9; ++j) {
if (i == 0 && j == 0)
continue;
scanf("%s", s);
if (s[0] == '?') {
good[cnt].x = i;
good[cnt].y = j;
++cnt;
} else {
mm[i][j] = s[0] - '0';
row[i][mm[i][j]] = 1;
col[j][mm[i][j]] = 1;
blo[(i / 3)*3 + j / 3][mm[i][j]] = 1;
}
}
}
dfs(0);
for (i = 0; i < 9; ++i) {
for (j = 0; j < 9; ++j) {
printf("%d", mm[i][j]);
if (j == 8)
printf("\n");
else
printf(" ");
}
}
}
return 0;
}