Pagini recente » Cod sursa (job #2715412) | Cod sursa (job #2721383) | Cod sursa (job #743431) | Cod sursa (job #2318835) | Cod sursa (job #2140442)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,st[19];
void Afisare()
{
int i;
for (i=1; i<=k; i++)
if (st[i] != 0)
out << st[i] << " ";
out << "\n";
}
void Back(int top)
{
int i;
if (top == k+1)
Afisare();
else
for (i=st[top-1]+1; i<=n-k+top; i++)
{
st[top] = i;
Back(top+1);
}
}
int main()
{
in >> n >> k;
Back(1);
return 0;
}