Pagini recente » Cod sursa (job #2850260) | Cod sursa (job #1113315) | Cod sursa (job #3236900) | Cod sursa (job #796013) | Cod sursa (job #3187221)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int folosit[30];
int diagonala1[30];
int diagonala2[30];
int rasp[30];
int cont;
bool ok;
void backtracking(int n, int linie, ofstream& f) {
if (linie == n + 1) {
if (ok == false) {
for (int i = 1; i <= n; i++) {
f << rasp[i] << " ";
}
f << endl;
cont = 1;
ok = true;
return;
} else {
cont += 1;
return;
}
}
for (int coloana = 1; coloana <= n; coloana++) {
if (diagonala1[linie - coloana + n] || diagonala2[linie + coloana] || folosit[coloana]) {
continue;
}
diagonala1[linie - coloana + n] =1;
diagonala2[linie + coloana] =1;
folosit[coloana] =1;
rasp[linie] = coloana;
backtracking(n, linie + 1, f);
diagonala1[linie - coloana + n] =0;
diagonala2[linie + coloana] =0;
folosit[coloana] =0;
}
}
int main() {
ifstream g("damesah.in");
ofstream f("damesah.out");
int n;
g >> n;
cont = 0;
ok = false;
backtracking(n, 1, f);
f << cont;
return 0;
}