Cod sursa(job #3313529)
| Utilizator | Data | 5 octombrie 2025 00:55:40 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <stdio.h>
int n, k;
int v[20], sz = 0;
void bkt(int pas) {
if (pas == k) {
for (int i = 0; i < sz; i++) {
printf("%d ", v[i]);
}
printf("\n");
}
else {
int last = 0;
if (sz > 0) {
last = v[sz - 1];
}
for (int i = last + 1; i <= n; i++) {
v[sz] = i;
sz++;
bkt(pas + 1);
v[sz] = 0;
sz--;
}
}
}
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
bkt(0);
}
