题目地址
AC代码
#include <iostream>
#include <algorithm>
using namespace std;
int list[9][9];
bool dfs(int x,int y){
if(y==9)return true;
int nx,ny;
nx = (x+1)%9;
ny = y+(x+1)/9;
if(list[y][x])return dfs(nx,ny);
else{
for (int i = 1; i <10 ; ++i) {
int boo = 1;
for (int j = 0; j < 9; ++j) {
if(list[y][j]==i){
boo = 0;
break;
}
}
if(boo)for (int k = 0; k < 9; ++k) {
if(list[k][x]==i){
boo = 0;
break;
}
}
if(boo)for (int l = (x/3)*3; l <(x/3)*3+3 ; ++l) {
for (int j = (y/3)*3; j <(y/3)*3+3 ; ++j) {
if(list[j][l]==i){
boo = 0;
break;
}
}
}
if(boo) {
list[y][x]=i;
if (dfs(nx, ny))return true;
}
}
list[y][x]=0;
return false;
}
}
int main() {
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--){
for (int i = 0; i < 9; ++i) {
for (int j = 0; j < 9; ++j) {
char x;
cin>>x;
list[i][j]=x-'0';
}
}
dfs(0,0);
for (int i = 0; i < 9; ++i) {
for (int j = 0; j < 9; ++j) {
cout<<list[i][j];
}
cout<<endl;
}
}
return 0;
}
题解和题目思路
这道题也是剪枝里面的题,但是这道题也没必要,不剪也可以直接过,于是直接按照题意DFS就行,无非一个个试。