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
1
103000509
002109400
000704000
300502006
060000050
700803004
000401000
009205800
804000107
Sample Output
143628579
572139468
986754231
391542786
468917352
725863914
237481695
619275843
854396127
题意:
一道数独题,0代表空格,输出填完的数组。
直接深搜,因为数据不是特别大,还有很多限制条件,所以不用剪枝。
有一点需要注意的是必须使用%1d读入,否则就会re。%1d是对于01矩阵进行快速读入的一种方式。
代码如下:
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
struct point
{
int x, y;
} p[100];
//row[i][j]表示第i行是否有数字j,col[i][j]表示第i列是否有数字j,
//mat[i][j][k]表示第(i,j)位置的小九宫格里是否有数字k
int map[15][15];
bool flag,row[15][15],col[15][15],mat[3][3][15];
int np;
void DFS(int num)
{
if(flag)
return;
int i,j;
if (num == -1)
{
for(i=0; i<9&&!flag; i++)
{
for(j=0; j<9; j++)
printf("%d",map[i][j]);
printf("\n");
}
flag=true;
return;
}
for (i=1; i<=9&&!flag; i++)
{
int x=p[num].x;
int y=p[num].y;
if (!row[x][i]&&!col[y][i]&&!mat[x/3][y/3][i])
{
row[x][i]=col[y][i]=mat[x/3][y/3][i]=true;
map[x][y]=i;
DFS(num-1);
row[x][i]=col[y][i]=mat[x/3][y/3][i]=false;
map[x][y]=0;
}
}
}
int main()
{
int t,i,j;
scanf("%d",&t);
while(t--)
{
memset(row,false,sizeof(row));
memset(col,false,sizeof(col));
memset(mat,false,sizeof(mat));
np=0;
for (i=0; i<9; i++)
{
for (j=0; j<9; j++)
{
scanf("%1d",&map[i][j]);
int num=map[i][j];
if (num)//有数非0
row[i][num]=col[j][num]=mat[i/3][j/3][num]=true;
else
{
p[np].x=i;
p[np++].y=j;
}
}
}
flag=false;
DFS(np-1);
}
return 0;
}