DFS直接搜吧
#include <iostream>
#include <vector>
using namespace std;
const int N = 15;
int n, t, cnt;
vector<int> res;
vector<vector<int>> ress;
bool dg[N * 2], udg[N * 2], col[N], row[N];
void dfs(int x) {
if (x == n + 1) {
t++;
ress.push_back(res);
//res.clear();
return;
}
for (int i = 1; i <= n; i++) {
if (!col[i] && !dg[x + i] && !udg[n - x + i]) {
res.push_back(i);
col[i] = dg[x + i] = udg[n - x + i] = true;
dfs(x + 1);
col[i] = dg[x + i] = udg[n - x + i] = false;
res.pop_back();
}
}
}
int main() {
int res = 0;
cin >> n;
dfs(1);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < n; j++) {
cout << ress[i][j] << " ";
}
cout << endl;
}
cout << t << endl;
system("pause");
return 0;
}