Pagini recente » Cod sursa (job #42795) | Cod sursa (job #1317334) | Cod sursa (job #2534643) | Cod sursa (job #1434258) | Cod sursa (job #1847834)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, h;
int sol[201];
bool vis[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++) {
if (vis[i] == 0) {
sol[k] = i;
vis[i] = 1;
explore(k + 1, i);
vis[i] = 0;
}
}
}
}
int main() {
in >> n >> h;
explore(0, 0);
return 0;
}