Pagini recente » Cod sursa (job #128592) | Cod sursa (job #2087099) | Cod sursa (job #180678) | Cod sursa (job #2953873) | Cod sursa (job #521137)
Cod sursa(job #521137)
#include<stdio.h>
int n,sol[1001],p,i;
int valid(int p)
{
int i;
for(i=1;i<p;i++)
if(sol[i]==sol[p])
return 0;
return 1;
}
void bkt(int p)
{
int i;
if(p==n+1)
{
for(i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
return;
}
for(i=1;i<=n;i++)
{
sol[p]=i;
if(valid(p))
bkt(p+1);
}
}
int main()
{
freopen("bkt.in","r",stdin);
freopen("bkt.out","w",stdout);
scanf("%d",&n);
bkt(1);
return 0;
}