Pagini recente » Cod sursa (job #3275018) | Cod sursa (job #1478467) | Diferente pentru implica-te/arhiva-educationala intre reviziile 87 si 223 | Cod sursa (job #524720) | Cod sursa (job #3244293)
#include <stdio.h>
#include <stdlib.h>
#define MAXN 8
int perm[MAXN+1],f[MAXN+1],n;
FILE *fin,*fout;
void bkt(int level) {
int i;
if(level>n) {
for(i=1; i<=n; i++) {
fprintf(fout,"%d ",perm[i]);
}
fputc('\n',fout);
return;
}
for(i=1; i<=n; i++) {
if(f[i]==0) {
f[i]=1;
perm[level]=i;
bkt(level+1);
f[i]=0;
}
}
}
int main() {
fin=fopen("permutari.in","r");
fscanf(fin,"%d",&n);
fclose(fin);
fout=fopen("permutari.out","w");
bkt(1);
fclose(fout);
return 0;
}