Pagini recente » Cod sursa (job #1044614) | concurs_infoarena | Cod sursa (job #1279918) | Cod sursa (job #1732368) | Cod sursa (job #2883876)
#include <bits/stdc++.h>
using namespace std;
void read_input(int &n, int &k) {
ifstream in("combinari.in");
in >> n >> k;
in.close();
return;
}
void solve(int n, int k, vector<int> res, ofstream &out) {
if (res.size() == k) {
for(int i = 0; i < res.size(); i++) {
out << res[i] << ' ';
}
out << '\n';
return;
}
int min_add;
if (res.size())
min_add = res.back() + 1;
else
min_add = 1;
for (int i = min_add; i <= n; i++) {
res.push_back(i);
solve(n, k, res, out);
res.pop_back();
}
}
int main() {
int n, k;
ofstream out("combinari.out");
vector<int> res;
read_input(n, k);
solve(n, k, res, out);
out.close();
return 0;
}