Pagini recente » Cod sursa (job #2695116) | Cod sursa (job #2444353) | Cod sursa (job #2272628) | Cod sursa (job #2775739) | Cod sursa (job #153735)
Cod sursa(job #153735)
#include <stdio.h>
int main()
{FILE *fin,*fout;
int st[10],n,i,k,as,ev;
fin=fopen("permutari.in","r");
fscanf(fin,"%d",&n);
fclose(fin);
fout=fopen("permutari.out","w");
k=1;st[1]=0;
while (k>0)
{
do
{as=0;
if (st[k]<n) {st[k]++;
as=1;
}
if (as) {ev=1;
for (i=1;i<k;i++)
if (st[k]==st[i]) ev=0;
}
}
while (!((!as) || (as && ev)));
if (as)
if (k==n)
{for (i=1;i<=n;i++)
fprintf(fout,"%d ",st[i]);
fprintf(fout,"\n");
//k--;
}
else
{k++;
st[k]=0;
}
else k--;
}
fclose(fout);
return 0;
}