Cod sursa(job #858856)
Utilizator | Alexandru Valeanu AlexandruValeanu | Data | 19 ianuarie 2013 14:27:06 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
int n, m;
int st[20];
FILE *f = fopen("combinari.in", "r");
FILE *g = fopen("combinari.out", "w");
void citire(){
fscanf(f, "%d %d", &n, &m);
}
void afis(){
for(int i = 1; i <= m; i++)
fprintf(g,"%d ", st[i]);
fprintf(g,"\n");
}
void back(int k){
if(k == m + 1)
afis();
else
for(st[k] = st[k-1] + 1; st[k] <= n - m + k; st[k]++)
back(k+1);
}
int main(){
citire();
back(1);
return 0;
}