搜索专题整理复习
#include <iostream>
using namespace std;
const int N = 20;
int n;
char g[N][N];
bool col[N], dg[N], udg[N];
void dfs(int x) {
if (x == n) {
for (int i = 0; i < n; i++)
printf("%s\n", g[i]);
puts("");
return;
}
for (int i = 0; i < n; i++) {
if (!col[i] && !dg[x + i] && !udg[n - x + i]) {
g[x][i] = 'Q';
col[i] = dg[x + i] = udg[n - x + i] = 1;
dfs(x + 1);
col[i] = dg[x + i] = udg[n - x + i] = 0;
g[x][i] = '.';
}
}
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
g[i][j] = '.';
dfs(0);
return 0;
}
#include <iostream>
using namespace std;
const int N = 20;
int row[N], col[N], dg[N], udg[N];
char g[N][N];
int n;
void dfs(int x, int y, int cnt) {
if (cnt > n) return;
if (y == n) y = 0, x++;
if (x == n) {
if (cnt == n) {
for (int i = 0; i < n; i++)
printf("%s\n", g[i]);
puts("");
}
return;
}
g[x][y] = '.';
dfs(x, y + 1, cnt);
if (!row[x] && !col[y] && !dg[x + y] && !udg[x - y + n]) {
row[x] = col[y] = dg[x + y] = udg[x - y + n] = 1;
g[x][y] = 'Q';
dfs(x, y + 1, cnt + 1);
g[x][y] = '.';
row[x] = col[y] = dg[x + y] = udg[x - y + n] = 0;
}
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
g[i][j] = '.';
dfs(0, 0, 0);
return 0;
}
兄弟们点点关注!