Pagini recente » Cod sursa (job #2231162) | Cod sursa (job #2814178) | Cod sursa (job #2556785) | Cod sursa (job #2416378) | Cod sursa (job #523810)
Cod sursa(job #523810)
#include<stdio.h>
using namespace std;
int m,n,k,x[10000],i,nr;
int main()
{ FILE *fin, *fout;
fin = fopen ("combinari.in", "r");
fout= fopen ("combinari.out", "w");
fscanf (fin,"%d%d",&n,&k);
m=1; nr=0;
do
{ while(x[m]<(n+m-k))
{ x[m]=x[m]++;
if(m==k)
{ nr++;
for(i=1; i<=k; i++) fprintf (fout,"%d ",x[i]);
fprintf (fout,"\n");
}
else {m++; x[m]=x[m-1];}
}
m--;
} while(m);
fclose(fout); return 0;
}