Pagini recente » Cod sursa (job #1047357) | Cod sursa (job #2798350) | Cod sursa (job #3159720) | Cod sursa (job #1251579)
#include <fstream>
#include <bitset>
#define DIM 15
using namespace std;
ifstream f("damesah.in");
ofstream g("damesah.out");
int n,nr,i;
int sol[DIM];
bool C[DIM],D1[2*DIM],D2[2*DIM];
void back(int k){
int d1,d2;
if(k>n){
//avem solutie
if(!nr){
for(i=1;i<k;i++)
g<<sol[i]<<" ";
g<<"\n";
}
nr++;
return;
}
for(register int j=1;j<=n;j++){
d1=(k<=j?j-k+1:n+k-j);
d2=(k<=(n-j)?n-j-k+1:k+j);
if(!C[j] && !D1[d1] && !D2[d2]){
C[j]=D1[d1]=D2[d2]=true;
sol[k]=j;
back(k+1);
C[j]=D1[d1]=D2[d2]=false;
}
}
}
int main(void){
f>>n;
back(1);
g<<nr;
return 0;
}