Pagini recente » Cod sursa (job #398341) | Cod sursa (job #2190532) | Cod sursa (job #904450) | Cod sursa (job #2053694) | Cod sursa (job #2294986)
#include <bits/stdc++.h>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
const int Nmax = 15;
int n;
vector< int > sol(Nmax);
vector< vector< int > > sols;
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) {
sols.push_back(sol);
} 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);
for(int i = 1; i <= n; ++i) {
out << sols[0][i] << " ";
}
out << "\n" << (int)sols.size() << "\n";
in.close(); out.close();
return 0;
}