Cod sursa(job #654137)
| Utilizator | Data | 29 decembrie 2011 17:48:27 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
int a[9],n;
void afisare(){
int i;
for (i=1;i<=n;i++)
printf("%d ", a[i]);
printf("\n");
}
bool verif(int k){
int i;
for (i=1;i<k;i++)
if (a[i]==a[k])
return 0;
return 1;
}
void back(int lung){
if (lung==n+1)
afisare();
else
if (lung<=n)
for (int i=1;i<=n;i++){
a[lung]=i;
if (verif(lung))back(lung+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d %d", &n);
back(1);
return 0;
}