Cod sursa(job #2572129)
| Utilizator | Data | 5 martie 2020 11:49:44 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int MAX_N = 1e1 + 5;
int n, k;
vector <int> v(MAX_N, 0);
vector <bool> used(MAX_N, 0);
void bkt(int p) {
if (p == k + 1) {
for (int i = 1; i <= k; ++i) {
fout << v[i] << " ";
}
fout << "\n";
} else {
for (int i = v[p - 1] + 1; i <= n; ++i) {
v[p] = i;
bkt(p + 1);
}
}
}
int main() {
fin >> n >> k;
bkt(0 + 1);
return 0;
}
