Cod sursa(job #2099928)
| Utilizator | Data | 4 ianuarie 2018 20:40:58 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k;
bool seen[20];
int btVec[20];
void bt(int pas = 0) {
if (pas == k) {
for (int i = 0; i < k; i++)
fout << btVec[i] << " ";
fout << "\n";
return;
}
for (int v = 1; v <= n; v++) {
if (!seen[v]) {
btVec[pas] = v;
seen[v] = true;
bt(pas + 1);
seen[v] = false;
}
}
}
int main() {
fin >> n >> k;
bt();
return 0;
}