Pagini recente » Cod sursa (job #557873) | Cod sursa (job #565108) | Clasamentul arhivei de probleme | Cod sursa (job #1966243) | Cod sursa (job #2550102)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, cnt, R[21];
void Afisare()
{
for (int i = 1; i <= k; ++i)
fout << R[i] << " ";
fout << '\n';
}
void Back(int p)
{
if (p > k)
return Afisare();
for (int i = R[p - 1] + 1; i <= n; ++i)
{
R[p] = i;
Back(p + 1);
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}