Cod sursa(job #3362877)
| Utilizator | Data | 12 august 2026 21:38:17 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
const int MAXN = 18;
int v[MAXN];
int n, k;
FILE *fin, *fout;
void bkt(int poz, int nr) {
int i;
if (nr == k) {
for (i = 0; i < k; i++) {
fprintf(fout, "%d ", v[i]);
}
fprintf(fout, "\n");
} else if (poz <= n) {
v[nr] = poz;
bkt(poz + 1, nr + 1);//daca il iau
bkt(poz + 1, nr);//daca nu il iau
}
}
int main()
{
fin = fopen("combinari.in", "r");
fscanf(fin, "%d%d", &n, &k);
fclose(fin);
fout = fopen("combinari.out", "w");
bkt(1, 0);
fclose(fout);
return 0;
}
