Pagini recente » Cod sursa (job #1021713) | Cod sursa (job #3039369) | Cod sursa (job #664773) | Cod sursa (job #2550728) | Cod sursa (job #2922593)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 18;
int n, k;
ifstream in("combinari.in");
ofstream out("combinari.out");
int solCrt[1 + NMAX];
void back(int pozCrt, int valAnt)
{
if (pozCrt == k + 1)
{
for (int i = 1; i <= k; i++)
out << solCrt[i] << ' ';
out << '\n';
}
else
{
for (int i = valAnt + 1; i <= n; i++)
{
solCrt[pozCrt] = i;
back(pozCrt + 1, i);
}
}
}
int main()
{
in >> n >> k;
back(1, 0);
return 0;
}