Cod sursa(job #419340)
| Utilizator | Data | 17 martie 2010 12:25:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
FILE *f1 = fopen("combinari.in","r");
FILE *f2 = fopen("combinari.out","w");
int n,m;
int v[19];
void back(int k){
int i;
if(k == m + 1){
for(i=1; i<=m; i++)
fprintf(f2,"%d ",v[i]);
fprintf(f2,"\n");
return;
}
for(i=v[k-1]+1; i<=n; i++){
v[k] = i;
back(k + 1);
}
}
int main(){
fscanf(f1,"%d%d",&n,&m);
back(1);
fclose(f1);
fclose(f2);
return 0;
}
