Cod sursa(job #155922)
Utilizator | Data | 12 martie 2008 11:30:38 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <cstdio>
int N, K, S[32];
void back(int k, int l) {
int i;
if (k == K) {
for (i = 0; i < K; ++i)
printf("%d ", S[i]);
printf("\n");
} else
for (i = l + 1; i <= N; ++i) {
S[k] = i;
back(k+1, i);
}
}
int main(void) {
freopen("combinari.in", "rt", stdin);
freopen("combinari.out", "wt", stdout);
scanf(" %d %d", &N, &K);
back(0, 0);
return 0;
}