Cod sursa(job #339334)
| Utilizator | Data | 9 august 2009 13:51:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
FILE *f,*g;
int n,k,s[19];
void back(int l) {
if(l==k) {
for(int i=1;i<=k;i++)
fprintf(g,"%d ",s[i]);
fprintf(g,"\n");
}
else {
for(int j=s[l]+1;j<=n;j++) {
s[l+1]=j;
back(l+1);
}
}
}
int main() {
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&k);
back(0);
fclose(f);
fclose(g);
return 0;
}
