Cod sursa(job #2340467)
| Utilizator | Data | 10 februarie 2019 14:39:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int MAXN = 18;
const int MAXK = 18;
int n, k, sol[MAXN + 1];
void bck(int pas) {
if (pas > k) {
for (int i = 1; i <= k; ++ i) out << sol[i] << ' ';
out << '\n';
}
else {
for (int i = sol[pas - 1] + 1; i <= n; ++ i) {
sol[pas] = i;
bck(pas + 1);
}
}
}
int main() {
in >> n >> k;
bck(1);
return 0;
}