|Submit||All submissions||Best solutions||Back to list|
HS12DISU - O-Diagonal sudoku
Sudoku is an ancient Japanese puzzle game. If You do not know the rules, you can read them here.
This variant of the puzzle is called diagonal sudoku.
The goal is to fill a 9x9 playing grid with numbers from 1 to 9 so that in every row and in every column, all nine numbers are different. Also, each of the nine 3x3 parts of the sudoku grid must contain all the different numbers 1 to 9, and finally each of the two diagonals must contain all the different numbers from 1 to 9.
You are given the initial state of a diagonal sudoku board, in the form of nine characters in nine rows. There are no empty spaces between characters in the rows. Unknown fields in sudoku are represented with dots ('.') and all others are represented by digits from 1 to 9.
Print your solution in the same format as in the input. A real sudoku board must have a unique solution but ours can have multiple solutions. You are allowed to print any of them. For every test case at least one solution exists.
.26...95. Output: 145792638
By solving this problem you score 10 points.
|Added by:||Tata Dule|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM32-GCC ASM64 GAWK MAWK BC C-CLANG CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PY_NBC R RACKET RUST CHICKEN SED SQLITE SWIFT UNLAMBDA VB.NET|
|Resource:||High School Programming League 2012/13|