Cod sursa(job #3354639)
| Utilizator | Data | 19 mai 2026 15:48:29 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
void bkt(int k, int N, int K, vector<int> &st, ofstream &fout) {
for (int i = st[k - 1] + 1; i <= N; i++) {
st[k] = i;
if (k == K) {
for (int j = 1; j <= K; j++) {
fout << st[j] << ' ';
}
fout << endl;
} else {
bkt(k + 1, N, K, st, fout);
}
}
}
int main() {
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, K;
fin >> N >> K;
vector<int> st(K + 1, 0);
bkt(1, N, K, st, fout);
return 0;
}