Cod sursa(job #2449654)
| Utilizator | Data | 20 august 2019 13:31:09 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <cstdio>
using namespace std;
int n;
bool free[9];
int cur[9];
void gen(int lft) {
if(lft == 0) {
for(int i = 1; i <= n; i++)
printf("%d ", cur[i]);
printf("\n");
} else {
for(int i = 1; i <= n; i++)
if(free[i]) {
free[i] = 0;
cur[n - lft + 1] = i;
gen(lft - 1);
free[i] = 1;
}
}
}
int main() {
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; i++)
free[i] = 1;
gen(n);
return 0;
}
