forked from iamshubhamg/Leet-Code
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSudoku.cpp
148 lines (74 loc) · 1.03 KB
/
Sudoku.cpp
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
/* C++ program to solve Sudoku using backtracking */
#include<iostream>
using namespace std;
int sud[9][9];
bool isSafe(int row,int col,int num)
{
for(int i=0;i<9;i++)
{
if(sud[row][i] == num)
return false;
if(sud[i][col] == num)
return false;
}
int rowS=row-row%3,colS=col-col%3;
for(int i=rowS;i<rowS+3;i++)
{
for(int j=colS;j<colS+3;j++)
{
if(sud[i][j] == num)
return false;
}
}
return true;
}
bool solveSudoko()
{
int row,col;
bool flag=false;
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
if(sud[row][col] == 0)
{
flag=true;
break;
}
}
if(flag)
break;
}
if(!flag)
return true;
for(int num = 1;num<10;num++)
{
if(isSafe(row,col,num))
{
sud[row][col]=num;
if(solveSudoko())
return true;
sud[row][col]=0;
}
}
return false;
}
int main()
{
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
cin>>sud[i][j];
if(solveSudoko())
{
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
cout<<sud[i][j];
cout<<endl;
}
}
else
{
cout<<"No";
}
}