Cod sursa(job #1042815)
Utilizator | Data | 27 noiembrie 2013 18:26:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<cstdio>
int i,j,n,fr[20],x[20],k;
FILE *f,*g;
void back(int m){
int i;
if(m>k){
for(i=1;i<=k;i++){
fprintf(g,"%d ",x[i]);
}
fprintf(g,"\n");
return;
}
for(i=x[m-1]+1;i<=n;i++){
x[m]=i;
back(m+1);
}
}
int main(){
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d%d",&n,&k);
back(1);
fclose(f);
fclose(g);
return 0;
}