Pagini recente » Borderou de evaluare (job #1912418) | Cod sursa (job #3147737) | Cod sursa (job #1033784)
#include <stdio.h>
int k,n,v[18];
void comb(int p,int cif,FILE *fout){
int i;
if(p==k){
for(i=0;i<p;i++){
fprintf(fout,"%d ",v[i]);
}
fprintf(fout,"\n");
}else {
v[p]=cif;
comb(p+1,cif+1,fout);
if(n-cif>=k-p){
comb(p,cif+1,fout);
}
}
}
int main(){
FILE *fin,*fout;
fin=fopen("combinari.in","r");
fout=fopen("combinari.out","w");
fscanf(fin,"%d%d",&n,&k);
comb(0,1,fout);
fclose(fin);
fclose(fout);
return 0;
}