Pagini recente » Cod sursa (job #2737565) | Cod sursa (job #592225) | Cod sursa (job #24485) | Borderou de evaluare (job #366968) | Cod sursa (job #1809813)
#include <stdio.h>
int P[10], N;
bool viz[10];
void back(int k) {
for (int i = 1; i <= N; i++) {
if (!viz[i]) {
P[k] = i;
viz[i] = true;
if (k == N) {
for (int j = 1; j <= N; j++) {
printf("%d ", P[j]);
}
printf("\n");
viz[i] = false;
} else {
back(k + 1);
viz[i] = false;
}
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &N);
back(1);
return 0;
}