Pagini recente » Cod sursa (job #2414711) | Clasament preoni61b | Rating Miana Arisanu (miana) | Istoria paginii documentatie/pagina-de-profil | Cod sursa (job #3294963)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
vector<int> v(20);
void afisare(int k) {
for (int i = 1; i <= k; i++)
fout << v[i] <<" ";
fout << endl;
}
bool sol(int cnt, int k) {
return cnt == k;
}
bool ok(int k) {
for (int i = 1; i < k; i ++)
if (v[i] >= v[k])
return false;
return true;
}
void bkt (int cnt, int k, int n) {
for (int i = 1 ; i <= n; i++) {
v.at(cnt) = i;
if (ok(cnt)) {
if (sol(cnt, k))
afisare(k);
else bkt(cnt + 1, k, n);
}
}
}
int main() {
int n, k;
fin >> n >> k;
bkt(1, k, n);
return 0;
}