Pagini recente » Cod sursa (job #2416278) | Cod sursa (job #548809) | Clasamentul arhivei Infoarena Monthly | Cod sursa (job #1733834) | Cod sursa (job #2449654)
#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;
}