Cod sursa(job #2908019)
Utilizator | Data | 1 iunie 2022 09:57:51 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, k, v[1001];
void bkt(int lg, int uc) {
if (lg == k + 1) {
for (int j = 1; j <= k; ++j) {
fout << v[j] << ' ';
}
fout << '\n';
return;
}
for (int i = uc; i <= n; ++i) {
v[lg] = i;
bkt(lg + 1, i + 1);
}
}
int main() {
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
fin >> n >> k;
bkt(1, 1);
return 0;
}