Cod sursa(job #2122635)
Utilizator | Data | 5 februarie 2018 12:54:57 | |
---|---|---|---|
Problema | Combinari | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
std::ifstream in("combinari.in");
std::ofstream out("combinari.out");
short n, k, result[8];
void bt(short j, short max) {
if (j == k) {
for (int i = 0;i < k;++i)
out << result[i] + 1 << " ";
out << "\n";
}
else
for (int i = max;i < n;++i) {
result[j] = i;
bt(j + 1, i + 1);
}
}
int main() {
in >> n >> k;
bt(0, 0);
}