Cod sursa(job #3123287)
| Utilizator | Data | 22 aprilie 2023 20:58:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int N, K;
vector<int> sol;
void back(int idx) {
if (idx == K) {
for (auto entry : sol) {
cout << entry << " ";
}
cout << "\n";
return;
}
int start = sol.empty() ? 1 : sol.back() + 1;
for (int next = start; next <= N; next++) {
sol.push_back(next);
back(idx + 1);
sol.pop_back();
}
}
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
cin >> N >> K;
back(0);
return 0;
}