Pagini recente » Cod sursa (job #2008895) | Cod sursa (job #1340766) | Cod sursa (job #2144733) | Cod sursa (job #182227) | Cod sursa (job #1847837)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, h;
int sol[201];
void explore(int k) {
if (k == h) {
for (int i = 0; i < h; i++) {
out << sol[i] << " ";
}
out << endl;
} else { // n-k+h
int y = 0;
if (0 < k) {
y = sol[k - 1];
}
for (int i = y + 1; i <= n - h + k + 1; i++) {
sol[k] = i;
explore(k + 1);
}
}
}
int main() {
in >> n >> h;
explore(0);
return 0;
}