Satisfiability Problem · SAT solvers

Lesson 4

Nikolai Chukhin · Alexander S. Kulikov

In the Sudoku puzzle, a \(9 \times 9\) grid is given pre-filled with digits from one to nine, and it is required to fill in the rest so that in each row, in each column, and in each of the nine \(3 \times 3\) blocks all digits are distinct.

Programming problem. Write a program to solve Sudoku.

This problem can only be submitted at Cogniterra.

Public samples

Public sample 1

Input

8********
**36*****
*7**9*2**
*5***7***
****457**
***1***3*
**1****68
**85***1*
*9****4**

Expected output