Pagini recente » Cod sursa (job #2316158) | Cod sursa (job #1714980) | Cod sursa (job #697592) | Cod sursa (job #1252671) | Cod sursa (job #2294974)
#include <bits/stdc++.h>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
const int Nmax = 15;
int n, sol[Nmax], ans;
bool valid(int k) {
for(int i = 1; i < k; ++i) {
if(sol[i] == sol[k] || (abs(sol[k] - sol[i]) == abs(k - i))) {
return false;
}
}
return true;
}
void bkt(int k) {
if(k == n + 1) {
ans++;
if(ans == 1) {
for(int i = 1; i <= n; ++i) {
out << sol[i] << " ";
}
out << "\n";
}
} else {
for(int i = 1; i <= n; ++i) {
sol[k] = i;
if(valid(k)) {
bkt(k + 1);
}
}
}
}
int main() {
ios::sync_with_stdio(false); in.tie(0); out.tie(0);
in >> n;
bkt(1);
out << ans << "\n";
in.close(); out.close();
return 0;
}