Pagini recente » Cod sursa (job #60979) | Cod sursa (job #881666) | Cod sursa (job #1476964) | Cod sursa (job #1163514) | Cod sursa (job #2220267)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
int subset[20];
void Print(void)
{
for (int i = 1; i <= m; i++)
{
fout << subset[i] << ' ';
}
fout << '\n';
}
void backtrack(int index)
{
for (int i = subset[index - 1] + 1; i <= n; i++)
{
subset[index] = i;
if (index == m)
{
Print();
}
else
{
backtrack(index + 1);
}
}
}
int main(void)
{
fin >> n >> m;
backtrack(1);
}