Pagini recente » Cod sursa (job #140940) | Cod sursa (job #486656) | Cod sursa (job #748468) | Cod sursa (job #187849) | Cod sursa (job #205556)
Cod sursa(job #205556)
#include<stdio.h>
int n,j,a[10],b[10];
void afisare()
{
for(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;}