Cod sursa(job #153186)
| Utilizator | Data | 10 martie 2008 11:28:20 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
int v[10],i,n,j;
void afiseaza()
{
int aux=0;
for(int i=1;i<n && aux==0 ;i++)
for(int j=i+1;j<=n && aux==0;j++)
if(v[i]==v[j])
aux=1;
if(aux==0)
{
for(i=1;i<=n;i++)
printf("%d ",v[i]);
printf("\n");
}
}
void back(int k)
{
if(k<=n+1)
{
if(k==n+1)
afiseaza();
for(int i=1;i<=n;i++)
{
v[k]=i;
back(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}