Pagini recente » Cod sursa (job #873130) | Cod sursa (job #614849) | Cod sursa (job #903362) | Cod sursa (job #667442) | Cod sursa (job #3355097)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n, k;
vector<int> sol;
ofstream fout("combinari.out");
void bkt(int step) {
if (step == k + 1) {
for (int i = 1; i <= k; ++i)
fout << sol[i] << (i == k ? "" : " ");
fout << "\n";
return;
}
for (int i = sol[step - 1] + 1; i <= n - k + step; ++i) {
sol[step] = i;
bkt(step + 1);
}
}
int main() {
ifstream fin("combinari.in");
fin >> n >> k;
sol.assign(k + 1, 0);
sol[0] = 0;
bkt(1);
fin.close();
fout.close();
return 0;
}