Cod sursa(job #173510)
| Utilizator | Data | 7 aprilie 2008 20:04:59 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<stdio.h>
long int s[11],n,k;
void back(long int k)
{long int i,j;
int ok;
if(k==n)
{for(i=1;i<=n;i++)
printf("%ld ",s[i]);
printf("\n");
}
else
{ for(i=1;i<=n;i++)
{ok=1;
for(j=1;j<=k;j++)
if(s[j]==i)
{ok=0;
break;
}
if(ok)
{s[k+1]=i;
back(k+1);
}
}
}
}
void main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%ld",&n);
back(0);
}
