Pagini recente » Cod sursa (job #2366397) | Cod sursa (job #1038400) | Cod sursa (job #2256942) | Cod sursa (job #2109721) | Cod sursa (job #1971463)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
const int Nmax=14;
int N,D[Nmax*2],V[Nmax],j,nr,Use[Nmax],L[Nmax],C[Nmax*2];
bool OK(int i)
{
if((D[i+V[i]+1]==0)&&(Use[V[i]]==0)&&(C[i-V[i]+N]==0))
{
Use[V[i]]=1;
C[i-V[i]+N]=1;
D[i+V[i]+1]=1;
return 1;
}
else return 0;
}
void Back(int i)
{
for(int j=1;j<=N;++j)
{
V[i]=j;
if(OK(i))
{
if(i==N)
{
nr++;
if(nr==1)
for(int k=1;k<=N;++k)
{
L[k]=V[k];
}
}
Back(i+1);
D[i+j+1]=0;
C[i-V[i]+N]=0;
Use[j]=0;
}
}
}
int main()
{
fin>>N;
Back(1);
for(int i=1;i<=N;++i)
{
fout<<L[i]<<" ";
}
fout<<"\n"<<nr<<"\n";
return 0;
}