Cod sursa(job #205554)
Utilizator | Sorodoc Ionut socheo | Data | 1 septembrie 2008 20:25:09 |
---|---|---|---|
Problema | Generare de permutari | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#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;}