Cod sursa(job #218983)
| Utilizator | Data | 4 noiembrie 2008 17:17:45 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
int n, marcat[10]={0}, sol[10]={0};
int valid(int k){
for(int i=1; i<k; ++i)
if(sol[k]==sol[i]) return 0;
return 1;
}
void afiseaza(){
for(int i=1; i<=n; ++i){
printf("%d ", sol[i]);
}
printf("\n");
}
void back(int k){
if(k==n+1){
afiseaza();
return;
}
for(int i=1; i<=n;++i){
sol[k]=i;
if(valid(k)==1)
back(k+1);
}
}
int main(){
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
back(1);
return 0;
}