Cod sursa(job #2910724)
Utilizator | Data | 24 iunie 2022 18:25:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[10];
bool ok[10];
int n, k;
void bkt(int poz) {
if (poz > k) {
for (int i = 1; i <= k; i++)
fout << v[i] << ' ';
fout << '\n';
} else {
for (v[poz] = 1+v[poz-1]; v[poz] <= n; v[poz]++) {
if (!ok[v[poz]]) {
ok[v[poz]] = true;
bkt(poz + 1);
ok[v[poz]] = false;
}
}
}
}
int main() {
fin >> n >> k;
bkt(1);
fin.close();
fout.close();
return 0;
}