poj2676Sudoku(dfs)

Sudoku

Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18081 Accepted: 8759 Special Judge

Description

Sudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The other cells are empty. The goal is to fill the empty cells with decimal digits from 1 to 9, one digit per cell, in such way that in each row, in each column and in each marked 3x3 subsquare, all the digits from 1 to 9 to appear. Write a program to solve a given Sudoku-task.

Input

The input data will start with the number of the test cases. For each test case, 9 lines follow, corresponding to the rows of the table. On each line a string of exactly 9 decimal digits is given, corresponding to the cells in this line. If a cell is empty it is represented by 0.

Output

For each test case your program should print the solution in the same format as the input data. The empty cells have to be filled according to the rules. If solutions is not unique, then the program may print any one of them.

Sample Input

1103000509002109400000704000300502006060000050700803004000401000009205800804000107

Sample Output

143628579572139468986754231391542786468917352725863914237481695619275843854396127//有点像最大二分匹配 dfs 的感觉长姿势了
#include<stdio.h>#include<string.h>char Map[10][10];int map[10][10];struct node{    int x,y;}s[1100];bool judge(int x,int y,int n){    int i,j;    for(i=0;i<9;i++)    {        if(map[x][i]==n)            return 0;        if(map[i][y]==n)            return 0;    }    int xx=x/3*3;    int yy=y/3*3;    for(i=0;i<3;i++)    {        for(j=0;j<3;j++)        {            if(map[xx+i][yy+j]==n)                return 0;        }    }    return 1;}int dfs(int step){    int i;    if(step<0)        return 1;    for(i=1;i<=9;i++)    {        int x=s[step].x;        int y=s[step].y;        if(judge(x,y,i))        {            map[x][y]=i;            if(dfs(step-1)) return 1;            map[x][y]=0;        }    }    return 0;}int main(){    int t;    int i,j,k;    scanf("%d",&t);    while(t--)    {        int num=0;        for(i=0;i<9;i++)        {            scanf("%s",Map[i]);            for(j=0;j<9;j++)            {                map[i][j]=Map[i][j]-'0';                if(!map[i][j])                {                    s[num].x=i;                    s[num++].y=j;                }            }        }        dfs(num-1);        for(i=0;i<9;i++)        {            for(j=0;j<8;j++)                printf("%d",map[i][j]);            printf("%d\n",map[i][j]);        }    }    return 0;}