Pagini recente » Cod sursa (job #2091409) | Cod sursa (job #1037695) | Cod sursa (job #2454706) | Cod sursa (job #2372838) | Cod sursa (job #2367559)
#include <cstdio>
bool visited[9];
int N, solution[8];
void printSolution(int stop) {
for (int it = 0; it < stop; ++it) printf("%d ", solution[it]);
printf("\n");
}
void generate(int level, int stop) {
if (level == stop) {
printSolution(stop);
return;
}
for (int it = 1; it <= stop; ++it) {
if (!visited[it]) {
solution[level] = it;
visited[it] = true;
generate(level + 1, stop);
visited[it] = false;
}
}
}
int main() {
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &N);
generate(0, N);
return 0;
}