Pagini recente » Cod sursa (job #2753103) | Cod sursa (job #2614419) | Cod sursa (job #1367187) | Cod sursa (job #2148507) | Cod sursa (job #1131816)
#include <cstdio>
int n;
int x[10];
void Print() {
for (int i = 0; i < n; ++i) {
printf("%d ", x[i]);
}
printf("\n");
}
bool Okey(int n) {
for (int i = 0; i < n; ++i) {
if (x[i] == x[n]) {
return(false);
}
}
return(true);
}
void Perm(int i) {
if (i == n) {
Print();
} else {
for (int k = 1; k <= n; ++k) {
x[i] = k;
if (Okey(i)) {
Perm(i + 1);
}
}
}
}
int main() {
freopen("permutari.in", "rt", stdin);
freopen("permutari.out", "wt", stdout);
scanf("%d", &n);
Perm(0);
}