题意就是求数独的解
数独游戏的规则是这样的:在一个9x9的方格中,你需要把数字1-9填写到空格当中,并且使方格的每一行和每一列中都包含1-9这九个数字。同时还要保证,空格中用粗线划分成9个3x3的方格也同时包含1-9这九个数字。比如有这样一个题,大家可以仔细观察一下,在这里面每行、每列,以及每个3x3的方格都包含1-9这九个数字。
终于做了一道有点意思的题了,蛤蛤,虽然是水题,但一开始脑洞开得有点大,以为回溯肯定会超时所以各种乱想,后来想了一下肯定不会超时就开始做了,输入各种蛋疼各种pe,做了一晚上终于ac
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
using namespace std;
#define LL long long
const int maxn = 10;
struct Node {
int x, y;
}nodes[maxn*maxn];
int G[maxn][maxn];
int visx[maxn][maxn], visy[maxn][maxn], visb[maxn][maxn]; //行、列、块的访问标记
int flag,num; //是否已完成搜索
void dfs(int step) {
if(step == num){
for(int i = 1; i <= 9; i++) {
for(int j = 1; j <= 9; j++){
if(j == 1) printf("%d", G[i][j]);
else printf(" %d", G[i][j]);
}
printf("\n");
}
flag = 1;
return;
}
int x = nodes[step].x, y = nodes[step].y;
int block = ((x - 1) / 3) * 3 + (y - 1)/3 + 1; //块号
for(int i = 1; i <= 9; i++) {
if(!visx[x][i] && !visy[y][i] && !visb[block][i]) {
visx[x][i] = visy[y][i] = visb[block][i] = 1;
G[x][y] = i;
dfs(step + 1);
if(flag) return;
visx[x][i] = visy[y][i] = visb[block][i] = 0;
G[x][y] = 0;
}
}
}
int main(){
//freopen("input.txt", "r", stdin);
char s[2];
int kase=0;
while(scanf("%s", s) != EOF){
memset(visx, 0, sizeof(visx));
memset(visy, 0, sizeof(visy));
memset(visb, 0, sizeof(visb));
num = 0;
flag=0;
if(s[0] == '?') {nodes[num].x = 1; nodes[num].y = 1; num++; G[1][1]=0;}
else {
G[1][1] = s[0] - '0';
visx[1][G[1][1]] = 1; visx[1][G[1][1]] = 1; visx[1][G[1][1]] = 1;
}
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++) {
if(i == 1 && j == 1) continue;
scanf("%s", s);
if(s[0] == '?') {nodes[num].x = i; nodes[num].y = j; num++; G[i][j]=0;}
else {
G[i][j] = s[0] - '0';
int block = ((i - 1) / 3) * 3 + (j - 1)/3 + 1;
visx[i][G[i][j]] = 1; visy[j][G[i][j]] = 1; visb[block][G[i][j]] = 1;
}
}
if(kase++) printf("\n");
dfs(0);
}
return 0;
}