Pagini recente » Cod sursa (job #2248516) | Istoria paginii runda/becreative11/clasament | Cod sursa (job #1355103) | Cod sursa (job #2463260) | Cod sursa (job #936659)
Cod sursa(job #936659)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
vector<int> a;
int n, k;
void generate(int i)
{
if (i > k) {
for (int j = 1; j <= k; ++j)
fout << a[j] << ' ';
fout << '\n';
}
else {
int maxj = n-k+i;
for (int j = a[i-1]+1; j <= maxj; ++j) {
a[i] = j;
generate(i+1);
}
}
}
int main()
{
fin >> n >> k;
a.resize(k+1);
generate(1);
return 0;
}