Pagini recente » Cod sursa (job #1786559) | Cod sursa (job #2526513) | Cod sursa (job #2978220) | Cod sursa (job #2370282) | Cod sursa (job #218709)
Cod sursa(job #218709)
# include <stdio.h>
# include <math.h>
int n,a[100];
int valid (int k)
{ int i;
for (i=1;i<k;i++)
if ((a[i]==a[k]))
return 0;
return 1;
}
void bkt (int k)
{
int i;
if (k==n+1) for (i=1;i<=n;i++)
printf("%ld ", a[i]);
else for (i=1;i<=n;i++)
{ a[k]=i;
if (valid (k)) bkt (k+1);
}printf("\n");
}
int main()
{
freopen ("permutari.in", "rt", stdin);
freopen ("permutari.out", "wt", stdout);
scanf("%ld", &n);
bkt(1);
return 0;
}