Pagini recente » Cod sursa (job #45058) | Cod sursa (job #2077720) | Cod sursa (job #2448652) | Cod sursa (job #2333024) | Cod sursa (job #1227045)
#include <stdio.h>
#define MAX 10
void perm(int);
int j, N, p[ MAX ], taken[ MAX ];
int main() {
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &N);
perm(1);
return 0;
}
void perm(int level) {
int i;
if(level == N + 1) {
for(j = 1; j <= N; j++) printf("%d ", p[ j ]);
printf("\n");
return;
}
for(i = 1; i <= N; ++i)
if( !taken[ i ] ) {
taken[ i ] = 1;
p[ level ] = i;
perm(level + 1);
taken[ i ] = 0;
}
}