题目链接:http://poj.org/problem?id=2676
//C++代码
#include<iostream>
#include<cstring>
using namespace std;
int sudoku[10][10];
bool row[10][10],col[10][10],grid[4][4][10];
bool dfs(int x,int y){
if(x==10) return 1;
bool flag=0;
if(sudoku[x][y]!=0){
flag=(y==9? dfs(x+1,1):dfs(x,y+1));
if(flag) return 1;
}
else{
int u=(x+2)/3,v=(y+2)/3;
for(int i=1;i<=9;i++){
if(!row[x][i] && !col[y][i] && !grid[u][v][i]){
sudoku[x][y]=i;
row[x][i]=col[y][i]=grid[u][v][i]=1;
flag=(y==9? dfs(x+1,1):dfs(x,y+1));
if(flag) return 1;
sudoku[x][y]=0;
row[x][i]=col[y][i]=grid[u][v][i]=0;
}
}
}
return 0;
}
int main(){
int n,m,i,j;
char ch[10][10];
cin>>n;
while(n--){
memset(row,0,sizeof(row));
memset(col,0,sizeof(col));
memset(grid,0,sizeof(grid));
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
cin>>ch[i][j];
m=sudoku[i][j]=ch[i][j]-'0';
if(m!=0) row[i][m]=col[j][m]=grid[(i+2)/3][(j+2)/3][m]=1;
}
}
dfs(1,1);
for(i=1;i<=9;i++){
for(j=1;j<=9;j++) cout<<sudoku[i][j];
cout<<endl;
}
}
return 0;
}