Cod sursa(job #2099919)
| Utilizator | Data | 4 ianuarie 2018 20:34:47 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
std::ifstream in("combinari.in");
std::ofstream out("combinari.out");
int bt_vec[18], n, k;
bool bt_seen[19];
void bt(int poz = 0) {
if (poz == k) {
for (int i = 0; i < k; i++) out << bt_vec[i] << ' ';
out << '\n';
}
for (int i = 1; i <= n; i++) {
if (bt_seen[i]) continue;
bt_vec[poz] = i;
bt_seen[i] = true;
bt(poz + 1);
bt_seen[i] = false;
}
}
int main() {
in >> n >> k;
bt();
return 0;
}