Pagini recente » Cod sursa (job #2531144) | Istoria paginii runda/cerculdeinfo-lectia10-trie_set_treap | Cod sursa (job #1760984) | Istoria paginii runda/rezolvarijudeteanaliceu | Cod sursa (job #1991568)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 15;
int N,nrSol;
bool col[NMax],diagPrin[2*NMax],diagSec[2*NMax];
int queen[NMax];
void backT(int);
int main() {
in>>N;
backT(1);
out<<'\n'<<nrSol<<'\n';
in.close();out.close();
return 0;
}
void backT(int nr) {
if (nr == N + 1) {
if (!nrSol) {
for (int i=1;i < nr;++i) {
out<<queen[i]<<' ';
}
}
++nrSol;
return;
}
for (int j=1;j <= N;++j) {
if (!diagPrin[nr-j+N] && !diagSec[nr+j] && !col[j]) {
diagPrin[nr-j+N] = diagSec[nr+j] = col[j] = 1;
queen[nr] = j;
backT(nr+1);
diagPrin[nr-j+N] = diagSec[nr+j] = col[j] = 0;
}
}
}