Pagini recente » Cod sursa (job #2873252) | Cod sursa (job #255147) | Cod sursa (job #255516) | Cod sursa (job #3131477) | Cod sursa (job #144671)
Cod sursa(job #144671)
#include <iostream>
#define FIN "permutari.in"
#define FOUT "permutari.out"
#define MAX_N 8
using namespace std;
int sol[MAX_N+1];
int used[MAX_N+1];
int n;
void back(int);
void afis();
void iofile(void){
freopen(FIN,"rt",stdin);
freopen(FOUT,"wt",stdout);
scanf("%d",&n);
fclose(stdin);
back(1);
fclose(stdout);
return ;
}
void back(int x){
if (x==n+1){afis();} else {
for (int i=1;i<=n;i++){
if (!used[i]){
sol[x]=i;
used[i]=1;
back(x+1);
used[i]=0;
}
}
}
}
void afis(void){
for (int i=1;i<=n;i++){
printf("%d ",sol[i]);
}
printf("\n");
}
int main(void){
iofile();
return 0;
}