Pagini recente » Cod sursa (job #1612200) | Cod sursa (job #2561081) | Cod sursa (job #2533815) | Cod sursa (job #1327915) | Cod sursa (job #2975382)
#include <iostream>
#include <fstream>
using namespace std;
#ifdef LOCAL
ifstream fin("input.txt");
#define fout cout
#else
ifstream fin("damesah.in");
ofstream fout("damesah.out");
#include <bits/stdc++.h>
#define endl '\n'
#endif
int n;
int a[15];
bool lin[15], col[15], diag1[25], diag2[25];
int ans_cnt;
int get_diag1(int i, int j) {
return i + j - 1;
}
int get_diag2(int i, int j) {
return i + (n - j + 1) - 1;
}
void solve(int k) {
if (k > n) {
if (ans_cnt == 0) {
for (int i = 1; i <= n; i++) {
fout << a[i] << ' ';
}
fout << endl;
}
ans_cnt++;
}
for (int j = 1; j <= n; j++) {
if (!col[j] && !diag1[get_diag1(k, j)] && !diag2[get_diag2(k, j)]) {
col[j] = 1;
a[k] = j;
diag1[get_diag1(k, j)] = 1;
diag2[get_diag2(k, j)] = 1;
solve(k + 1);
col[j] = 0;
a[k] = 0;
diag1[get_diag1(k, j)] = 0;
diag2[get_diag2(k, j)] = 0;
}
}
}
int main() {
fin >> n;
solve(1);
fout << ans_cnt;
return 0;
}