blob: 9b9cc84910de30264f6f5c64273533540128bc84 (
plain) (
blame)
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>
int* firstEmpty(int board[4][4]) {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (board[i][j] == -1)
return &board[i][j];
}
}
return nullptr;
}
bool isSolvedTakuzo(int board[4][4]) {
// Бройка в ред или колона
// Не е нужно да пазим или проверяваме броя 1ци, понеже той е 4 - zeroes
int zeroes = 0;
for (int i = 0; i < 4; i++) {
if (board[i][0] == 0) zeroes++;
}
// Бройка на редове
for (int i = 0; i < 4; i++) {
int currentZeroes = 0;
for (int j = 0; j < 4; j++) {
if (board[i][j] == 0) currentZeroes++;
}
if (currentZeroes != zeroes) return false;
}
// Бройка на колони
for (int i = 0; i < 4; i++) {
int currentZeroes = 0;
for (int j = 0; j < 4; j++) {
if (board[j][i] == 0) currentZeroes++;
}
if (currentZeroes != zeroes) return false;
}
// Последователни в ред
for (int i = 0; i < 4; i++) {
for (int j = 2; j < 4; j++) {
if (board[i][j - 2] == board[i][j - 1] && board[i][j - 1] == board[i][j]) return false;
}
}
// Последователни в колона
for (int i = 2; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (board[i - 2][j] == board[i - 1][j] && board[i - 1][j] == board[i][j]) return false;
}
}
return true;
}
void printTakuzo(int board[4][4]) {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
std::cout << board[i][j] << " ";
}
std::cout << std::endl;
}
}
void solveTakuzo(int board[4][4], bool &isSolved) {
int* toFill = firstEmpty(board);
if (toFill == nullptr) {
if (isSolvedTakuzo(board)) {
isSolved = true;
printTakuzo(board);
}
return;
}
if (!isSolved) {
*toFill = 0;
solveTakuzo(board, isSolved);
}
if (!isSolved) {
*toFill = 1;
solveTakuzo(board, isSolved);
}
*toFill = -1;
}
void solveTakuzo(int board[4][4]) {
bool isSolved = false;
solveTakuzo(board, isSolved);
}
int main() {
int board[4][4];
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
std::cin >> board[i][j];
}
}
solveTakuzo(board);
}
|
