-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy path8queens.cpp
More file actions
86 lines (79 loc) · 1.55 KB
/
8queens.cpp
File metadata and controls
86 lines (79 loc) · 1.55 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
#include <iostream>
#include <string>
#include <vector>
#include <utility>
using namespace std;
int main() {
vector<vector<int>> board(8, vector<int>(8, 0));
vector<pair<int, int>> queens;
char q;
for (int r = 0; r < 8; r++) {
for (int c = 0; c < 8; c++) {
cin >> q;
if (q == '*') {
board[r][c] = 1;
queens.push_back(make_pair(r, c));
}
}
}
if (queens.size() != 8) {
cout << "invalid\n";
return 0;
}
for (auto queen : queens) {
int r = queen.first, c = queen.second;
// row
for (int i = 0; i < 8; i++) {
if (board[r][i] == 1 && i != c) {
cout << "invalid\n";
return 0;
}
}
// column
for (int i = 0; i < 8; i++) {
if (board[i][c] == 1 && i != r) {
cout << "invalid\n";
return 0;
}
}
// left diagonal
int x = c, y = r;
while (x - 1 >= 0 && y - 1 >= 0) {
x -= 1;
y -= 1;
if (board[y][x] == 1 && y != r && x != c) {
cout << "invalid\n";
return 0;
}
}
x = c, y = r;
while (x + 1 < 8 && y + 1 < 8) {
x += 1;
y += 1;
if (board[y][x] == 1 && y != r && x != c) {
cout << "invalid\n";
return 0;
}
}
// right diagonal
x = c, y = r;
while (x + 1 < 8 && y - 1 >= 0) {
x += 1;
y -= 1;
if (board[y][x] == 1 && y != r && x != c) {
cout << "invalid\n";
return 0;
}
}
while (x - 1 >= 0 && y + 1 < 8) {
x -= 1;
y += 1;
if (board[y][x] == 1 && y != r && x != c) {
cout << "invalid\n";
return 0;
}
}
}
cout << "valid\n";
return 0;
}