-
Notifications
You must be signed in to change notification settings - Fork 49
/
Sudoku.cpp
99 lines (93 loc) · 1.74 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
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
#define N 4
void Display(int arr[][N])
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
cout << arr[i][j] << ", ";
}
cout << endl;
}
cout << endl;
}
bool IsSafe(int arr[][N], int row, int col, int numberToPut)
{
for (int i = 0; i < N; i++)
{
if (arr[row][i] == numberToPut)
{
return false;
}
}
for (int j = 0; j < N; j++)
{
if (arr[j][col] == numberToPut)
{
return false;
}
}
int sqt = sqrt(N);
int start = row - row % sqt;
int end = col - col % sqt;
for (int i = start; i < start + sqt; i++)
{
for (int j = end; j < end + sqt; j++)
{
if (arr[i][j] == numberToPut)
{
return false;
}
}
}
return true;
}
void Solve(int arr[][N])
{
int row = -1, col = -1;
int flag = 0;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
if (arr[i][j] == 0)
{
row = i;
col = j;
flag = 1;
}
}
if (flag == 1)
{
break;
}
}
if (flag == 0)
{
Display(arr);
return;
}
for (int i = 1; i <= N; i++)
{
if (IsSafe(arr, row, col, i) == 1)
{
arr[row][col] = i;
Solve(arr);
arr[row][col] = 0;
}
}
}
int main(int argc, char const *argv[])
{
int Board[N][N] = {
{4, 1, 3, 0},
{2, 0, 0, 0},
{0, 0, 0, 0},
{0, 0, 0, 4}};
Solve(Board);
return 0;
}