Cod sursa(job #2737700)
| Utilizator | Data | 5 aprilie 2021 00:05:33 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int max_n = 20;
int n, k;
int st[max_n];
void print() {
for (int i = 1; i <= k; i++) {
out << st[i] << " ";
}
out << "\n";
}
void bkt(int p) {
for (int i = st[p - 1] + 1; i <= n; i++) {
st[p] = i;
if (p == k) {
print();
} else {
bkt(1 + p);
}
}
}
int main() {
in >> n >> k;
bkt(1);
return 0;
}
