Pagini recente » Cod sursa (job #666334) | Cod sursa (job #2500410) | Cod sursa (job #849903) | Cod sursa (job #2891157) | Cod sursa (job #1427823)
#include<cstdio>
int n,m,q[14],c[14],a[28],b[28];
void A(int l) {
if(l==n) {
if(m<1) {
for(int i=0;i<n;i++)
printf("%d ",q[i]+1);
printf("\n");
}
m++;
}
else
for(int 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);
}