-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnqueens.cc
43 lines (39 loc) · 888 Bytes
/
nqueens.cc
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
#include <iostream>
#include <vector>
#include <string>
using namespace std;
typedef vector<int> vi_t;
void _nqueens(vi_t& q, unsigned n) {
if (q.size() == n) {
const char* sep = "";
for (unsigned c = 0; c < n; ++c) {
int r = q[c] + 1;
cout << sep << "abcdefgh"[c] << r; sep = " ";
}
cout << '\n';
}
int cnext = q.size();
for (int rnext = 0; rnext < int(n); ++rnext) {
bool rok = true;
for (int c = 0; rok && (c < cnext); ++c) {
rok = (rnext != q[c]) &&
(cnext - rnext != c - q[c]) && // diagonal ./.
(cnext + rnext != c + q[c]); // diahonal .\.
}
if (rok) {
q.push_back(rnext);
_nqueens(q, n);
q.pop_back();
}
}
}
void nqueens(int n) {
cout << n << " Queens:\n";
vi_t q;
_nqueens(q, n);
}
int main(int argc, char** argv) {
int n = stoi(argv[1]);
nqueens(n);
return 0;
}