Pagini recente » Cod sursa (job #2205798) | Istoria paginii runda/test_bossimici | Cod sursa (job #2579524) | Cod sursa (job #1064175) | Cod sursa (job #2306563)
#include<cstdio>
int n,m,q[14],c[14],a[28],b[28];
void A(int l)
{
int i;
if(l==n)
{
if(m<1)
{
for(i=0;i<n;i++)
printf("%d ",q[i]+1);
printf("\n");
}
m++;
}
else
for(i=0;i<n;i++)
if(!c[i]&&!a[i-l+n-1]&&!b[l+i])
q[l]=i,c[i]=a[i-l+n-1]=b[l+i]=1,A(l+1),c[i]=a[i-l+n-1]=b[l+i]=0;
}
int main()
{
freopen("damesah.in","r",stdin),freopen("damesah.out","w",stdout),scanf("%d",&n),A(0),printf("%d",m);
}