Pagini recente » Cod sursa (job #623854) | Cod sursa (job #2049004) | Cod sursa (job #3269398) | Cod sursa (job #3141050) | Cod sursa (job #1179965)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int v[20],rez,n,ok;
void pion(int k){
if(k>n){
++rez;
if(rez==1){
for(int i=1;i<=n;++i){
g <<v[i]<<" ";
}
}
}
else{
for(int j=1;j<=n;++j){
ok=1;
for(int i=1;i<k;++i){
if(v[i]==j || abs(v[i]-j)==abs(i-k)){
ok=0;
break;
}
}
if(ok){
v[k]=j;
pion(k+1);
}
}
}
}
int main()
{
f >>n;
pion(1);
g <<"\n"<<rez;
return 0;
}