Cod sursa(job #2282245)
Utilizator | Temes George Semetg | Data | 13 noiembrie 2018 15:23:02 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream in{"combinari.in"};
ofstream out{"combinari.out"};
int n, k;
int x[20];
bool fol[20];
void print() {
for (int i = 1; i <= k; ++i)
out << x[i] << ' ';
out << '\n';
}
void backTrack(int l) {
for (int i = x[l - 1] + 1; i <= n; ++i) {
x[l] = i;
if (!fol[i]) {
fol[i] = true;
if (l == k)
print();
else
backTrack(l + 1);
fol[i] = false;
}
}
}
int main()
{
in >> n >> k;
backTrack(1);
}