Pagini recente » Cod sursa (job #914327) | Cod sursa (job #433907) | Cod sursa (job #2248207) | Cod sursa (job #1953455) | Cod sursa (job #2376674)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
int v[20];
int bb[20][20];
int n,nr;
int verificare(int k){
for(int i=1;i<=k-1;++i)
if(abs(v[k]-v[i])==k-i || v[k]==v[i]) return 0;
return 1;
}
void solutie(){
if(nr==1) for(int i=1;i<=n;++i) out<<v[i]<<' ';
}
void backt(int k){
for(int i=1;i<=n;++i){
v[k]=i;
if(verificare(k)) {
if(k==n) {nr++;solutie();}
else backt(k+1);
}
}
}
int main()
{
in>>n;
backt(1);
out<<'\n'<<nr<<'\n';
return 0;
}