Pagini recente » Cod sursa (job #2779585) | Cod sursa (job #2598207) | Cod sursa (job #1405645) | Cod sursa (job #1328024) | Cod sursa (job #524236)
Cod sursa(job #524236)
#include<stdio.h>
int m, n, k,x[51],i;
int cont(int k)
{ for(int i=1;i<k;i++) if(x[i]==x[k]) return 0;
return 1;
}
void afis()
{ for(i=1; i<=m; ++i) printf ("%d ", x[i]);
printf ("\n");
}
void permutari()
{ k=1;x[k]=0;
do
{ while(x[k]<m)
{ x[k]++;
if(cont(k))
if(k==m) afis();
else {k++;x[k]=0;}
}
k--;
} while(k);
}
int main()
{ freopen ("permutari.in", "r", stdin);
freopen ("permutari.out", "w", stdout);
scanf ("%d",&m);
permutari();
return 0;
}