Pagini recente » Cod sursa (job #468898) | Cod sursa (job #1521756) | Cod sursa (job #1750578) | Cod sursa (job #3211397) | Cod sursa (job #1847835)
#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, int y) {
if (k == h) {
for (int i = 0; i < h; i++) {
out << sol[i] << " ";
}
out << endl;
} else { // n-k+h
for (int i = y + 1; i <= n - h + k + 1; i++) {
sol[k] = i;
explore(k + 1, i);
}
}
}
int main() {
in >> n >> h;
explore(0, 0);
return 0;
}