Pagini recente » Cod sursa (job #2815713) | Cod sursa (job #633992) | Cod sursa (job #1985315) | Cod sursa (job #2843641) | Cod sursa (job #153730)
Cod sursa(job #153730)
#include <stdio.h>
int main()
{FILE *fin,*fout;
int st[20],n,i,k,as,ev,m;
fin=fopen("combinari.in","r");
fscanf(fin,"%d %d",&n,&m);
fclose(fin);
fout=fopen("combinari.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;
if ((k>1)&&(st[k]<st[k-1])) ev=0;
}
}
while (!((!as) || (as && ev)));
if (as)
if (k==m)
{for (i=1;i<=m;i++)
fprintf(fout,"%d ",st[i]);
fprintf(fout,"\n");
//k--;
}
else
{k++;
st[k]=0;
}
else k--;
}
fclose(fout);
return 0;
}