-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
97 lines (80 loc) · 2.1 KB
/
main.cpp
File metadata and controls
97 lines (80 loc) · 2.1 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
95
96
97
#include <iostream>
using namespace std;
#define N 9
void printGrid(int grid[N][N]) {
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cout << grid[i][j] << " ";
}
cout << endl;
}
}
bool usedInRow(int grid[N][N], int row, int num){
for(int col=0;col<N;col++)
if(grid[row][col]==num)
return true;
return false;
}
bool usedInCol(int grid[N][N], int col, int num){
for(int row=0;row<N;row++)
if(grid[row][col]==num)
return true;
return false;
}
bool usedInBox(int grid[N][N], int boxStartRow,
int boxStartCol, int num){
for(int row=0;row<3;row++)
for(int col=0;col<3;col++)
if(grid[row+boxStartRow][col+boxStartCol]==num)
return true;
return false;
}
bool isSafe(int grid[N][N], int row, int col, int num){
return !usedInRow(grid,row,num) &&
!usedInCol(grid,col,num) &&
!usedInBox(grid,row-row%3,col-col%3,num);
}
bool findEmpty(int grid[N][N], int &row, int &col){
for(row=0;row<N;row++)
for(col=0;col<N;col++)
if(grid[row][col]==0)
return true;
return false;
}
bool solveSudoku(int grid[N][N]){
int row,col;
if(!findEmpty(grid,row,col))
return true;
for(int num=1;num<=9;num++){
if(isSafe(grid,row,col,num)){
grid[row][col]=num;
if(solveSudoku(grid))
return true;
grid[row][col]=0;
}
}
return false;
}
int main(){
int grid[N][N]={
{5,3,0,0,7,0,0,0,0},
{6,0,0,1,9,5,0,0,0},
{0,9,8,0,0,0,0,6,0},
{8,0,0,0,6,0,0,0,3},
{4,0,0,8,0,3,0,0,1},
{7,0,0,0,2,0,0,0,6},
{0,6,0,0,0,0,2,8,0},
{0,0,0,4,1,9,0,0,5},
{0,0,0,0,8,0,0,7,9}
};
cout<<"Original Sudoku:\n";
printGrid(grid);
if(solveSudoku(grid)){
cout<<"\nSolved Sudoku:\n";
printGrid(grid);
}
else{
cout<<"No Solution Exists";
}
return 0;
}