POJ2676-Sudoku【DFS】

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.

思路：数独问题，这道题的数据不是太强，所以我从头搜到尾的代码也没有超时，好像是poj3074来着数据要强一些。

从第一个开始，枚举当前位置哪个数字可以满足条件，如果满足就搜下一个，直到所有的都被放置好。

#include <cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int m[12][12];
bool flag = false;

bool isok(int n, int v) //判断是否符合标准
{
    int x1 = n / 9, y1 = n % 9;
    int x2 = n / 9 / 3 * 3, y2 = n % 9 / 3 * 3;
    for(int i = 0; i < 9; ++i) //大格子
    {
        if(m[x1][i] == v || m[i][y1] == v)
            return false;
    }
    for(int i = x2; i < x2 + 3; ++i) //小格子
        for(int j = y2; j < y2 + 3; ++j)
            if(m[i][j] == v)
                return false;
    return true;
}

void dfs(int n)
{
    if(n > 80)
    {
        flag = true;
        return;
    }
    if(m[n/9][n%9] != 0)
        dfs(n + 1);
    else
    {
        for(int i = 1; i <= 9; ++i)
        {
            if(isok(n, i))
            {
                m[n/9][n%9] = i;
                dfs(n + 1);
                if(flag) return;
                m[n/9][n%9] = 0; //回溯
            }
        }
    }
}


int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        for(int i = 0; i < 9; ++i)
            for(int j = 0; j < 9; ++j)
                scanf("%1d", &m[i][j]);
        flag = false;
        dfs(0);
        for(int i = 0; i < 9; ++i)
        {
            for(int j = 0; j < 9; ++j)
            {
                printf("%d", m[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}