Pagini recente » Cod sursa (job #1286678) | Cod sursa (job #1406331) | Cod sursa (job #981107) | Cod sursa (job #754002) | Cod sursa (job #1131505)
#include <stdio.h>
int n,x[10];
void back(int k)
{
int i,j,ok;
if(k==n+1)
{
for(i=1;i<=n;i++)
printf("%d ",x[i]);
printf("\n");
}
else
{
for(i=1;i<=n;i++)
{
x[k]=i;
ok=1;
for(j=1;j<k;j++)
if(x[j]==x[k])
{
ok=0;
break;
}
if(ok==1)
back(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
fclose(stdout);
return 0;
}