Pagini recente » Cod sursa (job #3340016) | Borderou de evaluare (job #2147820) | Cod sursa (job #3327094) | Cod sursa (job #1614985) | Cod sursa (job #3354734)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void backtrack(int step, int n, int k, vector<int>& sol) {
if (step == k) {
for (auto elem : sol) {
fout << elem << ' ';
}
fout << '\n';
return;
}
for (int i = (step > 0 ? sol[step - 1] + 1 : 1); i <= n; i++) {
sol[step] = i;
backtrack(step + 1, n, k, sol);
}
}
int main() {
int n, k;
fin >> n >> k;
vector<int> sol(k);
backtrack(0, n, k, sol);
fin.close();
fout.close();
return 0;
}