Pagini recente » Cod sursa (job #2568833) | Cod sursa (job #904362) | Cod sursa (job #1252233) | Cod sursa (job #314619) | Cod sursa (job #2322795)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int N, K;
int comb[19];
void bk(int curr)
{
if (curr == K + 1)
{
for (int i = 1; i <= K; i++)
g << comb[i] << ' ';
g << '\n';
}
for (int next = comb[curr - 1] + 1; next <= N - K + curr; next++)
{
comb[curr] = next;
if (curr <= K)
bk(curr + 1);
}
}
int main()
{
f >> N >> K;
//
bk(1);
//
f.close();
g.close();
return 0;
}