Cod sursa(job #1418782)
| Utilizator | Data | 13 aprilie 2015 23:48:56 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <cstdio>
using namespace std;
int bk[10],used[10],n;
void afisare(){
for(int i=1;i<=n;i++){
printf("%d ",bk[i]);
}
printf("\n");
}
void back(int pas){
if(pas == n+1){
afisare();
}else{
for(int i=1;i<=n;i++){
if(!used[i]){
used[i]=1;
bk[pas]=i;
back(pas+1);
used[i]=0;
}
}
}
}
int main() {
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
back(1);
return 0;
}
