Pagini recente » Cod sursa (job #258535) | Cod sursa (job #87394) | Cod sursa (job #2718395) | Cod sursa (job #1417456) | Cod sursa (job #3163538)
#include <fstream>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
const int DIM = 30;
int n;
int sol[DIM], solCnt;
bool vis[DIM], diag1[DIM], diag2[DIM];
bool found = false;
void backtrack(int step) {
if (step == n + 1) {
if (!found) {
found = true;
for (int i = 1; i <= n; i++)
fout << sol[i] << ' ';
fout << '\n';
}
solCnt++;
} else {
for (int i = 1; i <= n; i++) {
if (!vis[i] && !diag1[n + step - i] && !diag2[step + i - 1]) {
sol[step] = i;
vis[i] = true, diag1[n + step - i] = true, diag2[step + i - 1] = true;
backtrack(step + 1);
vis[i] = false, diag1[n + step - i] = false, diag2[step + i - 1] = false;
}
}
}
}
int main() {
fin >> n;
backtrack(1);
fout << solCnt;
return 0;
}