Problem 1934. GJam 2014 China Rd B: Sudoku Checker
This Challenge is derived from GJam 2014 China Sudoku. Large Case.
The Goal is determine if the Sudoku square is valid. Each row and column must contain 1:N, for an NxN matix. Nroot=N^.5. Each NrootxNroot block must contain 1:N where blocks start at [1,1+Nroot,...] in Row/Col.
Input: [M], NxN matrix (3^2<=N<=6^2)
Output: TF, 1=Valid, 0=Invalid
Examples:
TF=1 5 3 4 6 7 8 9 1 2 6 7 2 1 9 5 3 4 8 1 9 8 3 4 2 5 6 7 8 5 9 7 6 1 4 2 3 4 2 6 8 5 3 7 9 1 7 1 3 9 2 4 8 5 6 9 6 1 5 3 7 2 8 4 2 8 7 4 1 9 6 3 5 3 4 5 2 8 6 1 7 9
TF=0 5 3 4 6 7 8 9 1 2 6 7 2 1 9 5 3 4 8 1 9 8 3 4 2 5 6 7 8 5 9 7 6 1 4 2 3 4 2 6 8 999 3 7 9 1 7 1 3 9 2 4 8 5 6 9 6 1 5 3 7 2 8 4 2 8 7 4 1 9 6 3 5 3 4 5 2 8 6 1 7 9
Contest Performance: Best Delta Time of 7 minutes with 1146 of 2010 able to process the large data set.
Solution Stats
Problem Comments
-
1 Comment
Extension of Problem #114
Solution Comments
Show commentsProblem Recent Solvers60
Suggested Problems
-
18446 Solvers
-
Flag largest magnitude swings as they occur
678 Solvers
-
Given a window, how many subsets of a vector sum positive
851 Solvers
-
313 Solvers
-
Set some matrix elements to zero
524 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!