Cod sursa(job #3328963)
| Utilizator | Data | 11 decembrie 2025 13:18:40 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int nMax = 20;
int n, k;
int comb[nMax];
void bkt(int pos) {
if (pos <= k) {
for (int i = comb[pos - 1] + 1; i <= n; i += 1)
comb[pos] = i, bkt (pos + 1);
} else if (pos == k + 1) {
for (int i = 1; i < pos; i += 1)
fout << comb[i] << ' ';
fout << '\n';
}
}
int main () {
fin >> n >> k;
bkt (1);
return 0;
}