Pagini recente » Cod sursa (job #716679) | Cod sursa (job #2732237) | Istoria paginii runda/simulare_oji_10_4/clasament | Cod sursa (job #906647) | Cod sursa (job #1994959)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cstring>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
#define ll long long
#define pb push_back
#define ui unsigned int
const int inf = 1e9 + 5;
const int NMax = 15 + 5;
int N,nrSol;
int queen[NMax];
bool col[NMax],diag1[NMax],diag2[NMax];
void backT(int);
int main() {
in>>N;
backT(1);
out<<nrSol<<'\n';
in.close();out.close();
return 0;
}
void backT(int i) {
if (i == N + 1) {
if (!nrSol) {
for (int k=1;k <= N;++k) {
out<<queen[k]<<' ';
}
out<<'\n';
}
++nrSol;
return;
}
for (int j=1;j <= N;++j) {
if (!col[j] && !diag1[N + i - j] && !diag2[i + j]) {
col[j] = diag1[N + i - j] = diag2[i + j] = true;
queen[i] = j;
backT(i+1);
col[j] = diag1[N + i - j] = diag2[i + j] = false;
}
}
}