Pagini recente » Cod sursa (job #1749347) | Cod sursa (job #3204403) | Cod sursa (job #442883) | Cod sursa (job #568044) | Cod sursa (job #206776)
Cod sursa(job #206776)
#include <stdio.h>
const int N_MAX = 10;
int st[N_MAX], is[N_MAX], N;
void back(int k)
{
if (k == N + 1) {
for (int i = 1; i <= N; i ++) {
printf("%d ", st[i]);
}
printf("\n");
} else {
for (int c = 1; c <= N; c ++) {
if (!is[c]) {
is[c] = 1;
st[k] = c;
back(k + 1);
is[c] = 0;
}
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
#ifndef _SCREEN_
freopen("permutari.out", "w", stdout);
#endif
scanf("%d\n", &N);
back(1);
return 0;
}