Pagini recente » Cod sursa (job #146016) | Cod sursa (job #177389) | Cod sursa (job #2165546) | Cod sursa (job #1143304) | Cod sursa (job #2960118)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, subm[25], counter = 0, v[25], p = 1, f;
void gen(int element, int lgSubm) {
if (element == n + 1) {
for (int i = 1; i < lgSubm; ++i) {
counter++;
// cout << "counter = " << counter << endl;
//cout << subm[i] << " ";
v[p] = subm[i];
p++;
}
if(counter == f) {
for(int i = 1; i < lgSubm; ++i) {
fout << v[i] << " ";
}
fout << "\n";
}
p = 1;
counter = 0;
return;
}
subm[lgSubm] = element;
gen(element + 1, lgSubm + 1);
gen(element + 1, lgSubm);
}
int main()
{
int l = 1, k = 1;
fin >> n >> f;
gen(l, k);
return 0;
}