Sudoku
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 129 Accepted Submission(s): 46
Problem Description
The puzzle game of Sudoku is played on a board of N^2 × N^2 cells. The cells are grouped in N × N squares of N × N cells each. Each cell is either empty or contains a number between 1 and N^2.
The Sudoku position is correct when numbers in each row, each column and each square are different. The goal of the game is, starting from some correct positions; fill all empty cells so that the final position is still correct. (We call the final position is a solution to the starting position).
This problem is not about to solve a specific Sudoku puzzle, but ask you to find all correct positions that have a unique solution when N = 2.
The Sudoku position is correct when numbers in each row, each column and each square are different. The goal of the game is, starting from some correct positions; fill all empty cells so that the final position is still correct. (We call the final position is a solution to the starting position).
This problem is not about to solve a specific Sudoku puzzle, but ask you to find all correct positions that have a unique solution when N = 2.
Input
There's no input for this problem.
Output
Output x on a single line where x is the number of correct positions have a unique solution when N = 2.
Sample Output
HintThe Sudoku description is quoted from problem "Sudoku Checker", Northeastern Europe 2005这是一个数独题目,大概有两步骤1) 求得 N=2 的 288个解2) 判断每一个解 添加空格后 独一无二的解的个数 ,算总和