Pagini recente » Cod sursa (job #1879227) | Cod sursa (job #3139221) | Cod sursa (job #709345) | Cod sursa (job #2701690) | Cod sursa (job #1150513)
#include <stdio.h>
using namespace std;
int n, sol[20], lin, ok, nr, ii;
int d2[20], d1[20], col[20];
void backt(int lin)
{
for(int i=1; i<=n; ++i)
if(!d1[lin+i-1] && !d2[lin-i+n] && !col[i])
{
sol[lin]=i;
d1[lin+i-1]=d2[lin-i+n]=col[i]=1;
if(lin==n)
for(++ok, ii=0; ok<=1 && ii<n; printf("%d ", sol[++ii]));
else
backt(lin+1);
d1[lin+i-1]=d2[lin-i+n]=col[i]=0;
}
}
int main()
{
freopen("damesah.in", "r", stdin);
freopen("damesah.out", "w", stdout);
scanf("%d", &n);
backt(1);
printf("\n%d", ok);
return 0;
}