Cod sursa(job #2314790)
| Utilizator | Data | 9 ianuarie 2019 01:37:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#define KMAX 20
std::ifstream fin("combinari.in");
std::ofstream fout("combinari.out");
int n, k;
int comb[KMAX];
void gen(int pos) {
if (pos == k + 1) {
for (int i = 1; i <= k; i++)
fout << comb[i] << ' ';
fout << '\n';
return;
}
for (comb[pos] = comb[pos - 1] + 1; comb[pos] <= n; comb[pos]++)
gen(pos + 1);
}
int main() {
fin >> n >> k;
gen(1);
fout.close();
return 0;
}
