forked from jugshaurya/recursion-CN
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsudokuSolver.cpp
More file actions
94 lines (74 loc) · 1.64 KB
/
sudokuSolver.cpp
File metadata and controls
94 lines (74 loc) · 1.64 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <iostream>
#include<cmath>
using namespace std;
bool isValid(int num, int** mat, int n,int i,int j){
//column check
for(int k=0;k<n;k++){
if(mat[k][j] == num){
return false;
}
}
//row check
for(int k=0;k<n;k++){
if(mat[i][k] == num){
return false;
}
}
//sqrt(n) grid check
int starti,startj;
int sqrtn = sqrt(n);
starti = (i/sqrtn) * sqrtn;
startj = (j/sqrtn) * sqrtn;
for(int k=starti;k<starti+sqrtn;k++){
for(int l=startj;l<startj+sqrtn;l++){
if(mat[k][l] == num){
return false;
}
}
}
return true;
}
bool solveSudoku(int** mat, int n,int i,int j){
if(i == n ){
return true;
}
if(j == n){
return solveSudoku(mat,n,i+1,0);
}
if(mat[i][j] !=0){
return solveSudoku(mat,n,i,j+1);
}
//that means mat[i][j]==0
for(int k=1;k<=n;k++){
if(isValid(k,mat,n,i,j)){
mat[i][j] = k;
if(solveSudoku(mat,n,i,j+1)){
return true;
}
}
}
//all values are tried nothing works therefore
mat[i][j] = 0;
return false;
}
int main(){
int n;
cin>>n;
int** mat = new int*[n];
for(int i=0;i<n;i++){
mat[i] = new int[n];
}
for(int i=0;i<n;i++){
for(int j =0;j<n;j++){
cin>>mat[i][j];
}
}
solveSudoku(mat,n,0,0);
for(int i= 0;i<n;i++){
for(int j = 0;j<n;j++){
cout<<mat[i][j]<<" ";
}
cout<<endl;
}
return 0;
}