Cod sursa(job #2763787)
| Utilizator | Data | 16 iulie 2021 18:47:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, x[20], k;
void afisare() {
for(int i = 1; i <= k; i++) {
fout << x[i] << " ";
}
fout << "\n";
}
void back(int k1) {
for(int i = x[k1 - 1] + 1; i <= n - k + k1; i++) {
x[k1] = i;
if(k1 < k) {
back(k1 + 1);
} else {
afisare();
}
}
}
int main() {
fin >> n >> k;
fin.close();
back(1);
fout.close();
return 0;
}