Cod sursa(job #3375979)
| Utilizator | Data | 14 noiembrie 2026 20:26:18 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, x[20];
void afisare() {
for (int i = 1; i <= k; ++i)
fout << x[i] << (i == k ? "" : " ");
fout << "\n";
}
void back(int step, int start) {
if (step > k) {
afisare();
return;
}
for (int i = start; i <= n - k + step; ++i) {
x[step] = i;
back(step + 1, i + 1);
}
}
int main() {
fin >> n >> k;
back(1, 1);
fin.close();
fout.close();
return 0;
}
