forked from shafeeq/Sudoku
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchecks.cpp
71 lines (69 loc) · 1.78 KB
/
checks.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
// checks.cpp
//
// Copyright 2011 Shafeeq K <[email protected]>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
// MA 02110-1301, USA.
//
//
#include "checkfns.h"
#define ORDER 9
extern int sudoku[ORDER][ORDER];
int checkRow(int row, int num)
{
int foundnum = 0;
for (int i = 0; i < 9; i++) {
if (sudoku[row][i] == num) {
foundnum = 1;
break;
}
}
if (foundnum == 1)
return 0;
else
return 1;
}
int checkColumn(int column, int num)
{
int foundnum = 0;
for (int i = 0; i < 9; i++) {
if (sudoku[i][column] == num) {
foundnum = 1;
break;
}
}
if (foundnum == 1)
return 0;
else
return 1;
}
int checkSquare(int row, int column, int num)
{
int foundnum = 0;
int startIndexRow = (row / 3) * 3;
int startIndexColumn = (column / 3) * 3;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (sudoku[startIndexRow + i][startIndexColumn + j] == num ){
foundnum = 1;
break;
}
}
}
if (foundnum == 1)
return 0;
else
return 1;
}