Pagini recente » hgfdg | Cod sursa (job #2195004) | Cod sursa (job #1907386) | Cod sursa (job #2131085) | Cod sursa (job #1134332)
#include <stdio.h>
#include <stdlib.h>
/*
Sa se genereze toate permutarile valide pana la un numar n dat.
*/
int c[9];
int n;
FILE *fin,*fout;
void afisare() {
int i;
for(i=1;i<=n;i++)
fprintf(fout,"%d",c[i]);
fprintf(fout,"\n");
}
int conditie(int k) {
int i;
for(i=1;i<k;i++) {
if(c[k] == c[i])
return 0;
}
return 1;
}
void generare(int k) {
if(k==n+1)
afisare();
else {
int j;
for(j=1;j<=n;j++) {
c[k]=j;
if(conditie(k))
generare(k+1);
}
}
}
int main() {
fin=fopen("permutari.in","r");
fout=fopen("permutari.out","w");
fscanf(fin,"%d",&n);
generare(1);
return 0;
}