回溯-POJ2676-Sudoku

简介: 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 fr

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

hi

微笑题目大意

数独游戏。规则:在9*9的格子里,预先给你一些数。你要把它填满,你填的每个数字必须满足以下四个约束。

a。同行不重;
b。同列不重;
c。所在小方格不重;
d。属于[1,9]范围。

编程实现。若有多解,输出其中任意一个均可。

注意:

问:数独解答过程中,我在某个位置r行c列放了数x,x满足a\b\c\d四个约束,那么这一步一定是对的么?
答:不一定是对的。这样放,截至目前是对的,但在后续填写其他方格时会发现前面的一些尝试是错的,需要回溯。

微笑


目录
相关文章
|
7月前
华为机试HJ44:Sudoku(数独问题,深度优先遍历DFS解法)
华为机试HJ44:Sudoku(数独问题,深度优先遍历DFS解法)
|
7月前
|
人工智能
poj 2299 Ultra-QuickSort 求逆序数 树状数组解法
所谓离散化,我们的了解就是对原数组排序,然后用所在位置的下标代替原数,这样我们就可以把数据范围缩小到1-500000,这个数组是开的下的。
23 0
|
9月前
|
网络架构
POJ 3250 Bad Hair Day、POJ 2796 Feel Good(单调栈)
POJ 3250 Bad Hair Day、POJ 2796 Feel Good(单调栈)
|
机器学习/深度学习
HDU-2553,N皇后问题(DFS+回溯)
HDU-2553,N皇后问题(DFS+回溯)
|
C语言
HDOJ/HDU Tempter of the Bone(深搜+奇偶性剪枝)
HDOJ/HDU Tempter of the Bone(深搜+奇偶性剪枝)
80 0
td_
HDU_5952 Counting Cliques 深搜回溯
题意 HDU5952—16年沈阳E题给定一个无向图,输出图中节点个数为 s 的完全图的个数 思路 暴力深搜回溯,要点在于搜索时需要让当前点大于已经搜过的点,以此来去重,比如 1-3-5-4 这个完全图在之前必定可以搜出来 1-3-4-5,并且当前点要与之前的点保证有路,这样搜出来才是完全图做的时.
td_
1071 0