Cod sursa(job #2661533)
Utilizator | Data | 22 octombrie 2020 10:48:59 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int st[20];
bool f[20];
void afisare() {
for (int i = 1; i <= n; ++i) {
fout << st[i] << " ";
}
fout << "\n";
}
void backtrack(int top) {
if (top > n) {
afisare();
return;
}
for (int i = 1; i <= k; ++i) {
if (f[i] == 0) {
f[i] = 1;
st[top] = i;
backtrack(top + 1);
f[i] = 0;
}
}
}
int main() {
fin >> n >> k;
backtrack(1);
return 0;
}