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
|
#include <iostream>
void markQueen(int valueBy, int row, int col, int board[8][8]) {
for (int i = 0; i < 8; i++) {
board[row][i] += valueBy;
}
for (int i = 0; i < 8; i++) {
board[i][col] += valueBy;
}
for (int i = 0; i < 8; i++) {
if (row+i < 8 && col+i < 8)
board[row+i][col+i] += valueBy;
if (row-i > -1 && col-i > -1)
board[row-i][col-i] += valueBy;
}
for (int i = 0; i < 8; i++) {
if (row-i > -1 && col+i < 8)
board[row-i][col+i] += valueBy;
if (row+i < 8 && col-i > -1)
board[row+i][col-i] += valueBy;
}
}
void placeQueen(int row, int col, int board[8][8]) {
markQueen(1, row, col, board);
}
void removeQueen(int row, int col, int board[8][8]) {
markQueen(-1, row, col, board);
}
int possibleSolutions(int row, int board[8][8]) {
// Board is filled with queens
if (row == 8) {
// За бонуса, тук просто принтираме целия board
return 1;
}
// Find first free column, if any
int col = 0;
int sum = 0;
while (col < 8) {
// Place queen temporarily
if (board[row][col] == 0) {
placeQueen(row, col, board);
sum += possibleSolutions(row + 1, board);
removeQueen(row, col, board);
}
col++;
}
return sum;
}
int main() {
int board[8][8] = { { 0 } };
std::cout << possibleSolutions(0, board) << std::endl;
}
|
