Pagini recente » Cod sursa (job #2112835) | Cod sursa (job #1168885) | Cod sursa (job #2764612) | Cod sursa (job #2622799) | Cod sursa (job #145253)
Cod sursa(job #145253)
#include <stdio.h>
int n,a[10],b[10];
void back(int x)
{
if (x>n)
{
for (int j=1; j<=n; ++j) printf("%d ",a[j]);
printf("\n");
return;
}
int i;
for (i=1; i<=n; ++i)
{
if (b[i]==1) continue;
a[x]=i;
b[i]=1;
back(x+1);
b[i]=0;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}