一道在数独上的搜索题, 由于时间限制比较宽,所以可以直接搜索,搜索时只要搜索空白处就好了,不必遍历每个格子。
代码(C++):
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef pair<int,int> pii;
char matrix[12][12];
vector<pii> xy;
bool check(int a,int b,int c)
{
int i,j,n,m;
for(i=0;i<9;i++)
{
if(matrix[a][i]==c+'0') return false;
if(matrix[i][b]==c+'0') return false;
}
n=a/3;
m=b/3;
for(i=n*3;i<n*3+3;i++)
{
for(j=m*3;j<m*3+3;j++)
{
if(matrix[i][j]==c+'0') return false;
}
}
return true;
}
bool dfs(int num)
{
int i,a,b;
if(num>=xy.size()) return true;
a=xy[num].first;
b=xy[num].second;
for(i=1;i<=9;i++)
{
if(check(a,b,i))
{
matrix[a][b]=i+'0';
if(dfs(num+1)) return true;
matrix[a][b]='0';
}
}
return false;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t,i,j;
scanf("%d",&t);
while(t--)
{
for(i=0;i<9;i++)
{
scanf("%s",matrix[i]);
for(j=0;j<9;j++)
{
if(matrix[i][j]=='0') xy.push_back(make_pair(i,j));
}
}
dfs(0);
for(i=0;i<9;i++) printf("%s\n",matrix[i]);
xy.clear();
}
return 0;
}
题目( http://poj.org/problem?id=2676):
Sudoku
Time Limit: 2000MS | Memory Limit: 65536K | |||
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
1 103000509 002109400 000704000 300502006 060000050 700803004 000401000 009205800 804000107
Sample Output
143628579 572139468 986754231 391542786 468917352 725863914 237481695 619275843 854396127