Pagini recente » Cod sursa (job #1662753) | Cod sursa (job #613079) | Cod sursa (job #1951346) | Cod sursa (job #1682942) | Cod sursa (job #205557)
Cod sursa(job #205557)
#include<stdio.h>
int n,j,a[10],b[10];
void afisare()
{
for(int j=1;j<=n;j++)
printf("%d ",a[j]);
printf("\n");
}
void permut(int k)
{ if(k==n+1)
afisare();
else
for(int i=1;i<=n;i++)
if(b[i]==0)
{ a[k]=i;
b[i]=1;
permut(k+1);
b[i]=0; }
}
int main()
{ freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
permut(1);
return 0;}