SudokuXProblem code: J1 |
All submissions for this problem are available.
SudokuX is a variation of the popular game Sudoku. Similar to standard Sudoku, in SudokuX, we have to enter the numbers 1 - 9 once in each row, column and 3 x 3 square within the 9x9 puzzle grid. In addition to standard Sudoku, the numbers must only occur once in each of the two diagonals.
Johnny is very interested in playing SudokuX. He believes that this game is so challenging that even the best computer programs could not solve it efficiently.
Let's show Johnny the power of computers by writing a program to solve even the hardest SudokuX puzzles within seconds!
Input
The first line contains t, the number of test cases (about 10). Then t test cases follow.
Each test case consists of 9 lines. Each line contains 9 characters '.' (blank grid), or '1'..'9' representing a SudokuX puzzle.
Each test case is separated by a blank line.
You are guaranteed that each given SudokuX puzzle has a unique solution.
Output
For each puzzle, output the solution in the same format as the input. Print a blank line after each test case.
Example
Input 2 .8....2.. .1....5.. ..34..7.. ..9.5.... .2...46.. 3........ 9...2.... ......... ......4.7 ....41... ...6....5 .....7.9. ....1.3.. .5......1 .2....... ..18...76 .7......2 ........3 Output 486715293 712938546 593462718 679251384 128394675 354876129 945627831 867143952 231589467 293541768 748692135 615387294 864715329 357269481 129438657 531824976 476953812 982176543
| Date: | 2009-10-15 |
| Time limit: | 1s |
| Source limit: | 50000 |
| Languages: | C C99 strict C++ PAS gpc PAS fpc JAVA NICE JAR C# NEM ST ASM D FORT ADA BASH PERL PYTH RUBY LUA ICON PIKE PHP SCM guile SCM qobi LISP sbcl LISP clisp SCALA HASK ERL CAML CLPS PRLG WSPC BF ICK TEXT |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
Fetching successful submissions
"Print a blank line after
"Print a blank line after each test case.".
The Output example does not appear to have a blank line after last test case.
The test input/output is in
The test input/output is in accordance with the input output specs. However I doubt you would be penalized for printing / not printing the very last blank line.
for the above given testcases
for the above given testcases i think we can more than 1 solution.
my code gives some other output which is correctly filled
i am also getting other
i am also getting other solution for above input.
There is a unique solution to
There is a unique solution to both of those grids. You must be missing a constraint.