Pagini recente » Cod sursa (job #2119672) | Cod sursa (job #2287349) | Cod sursa (job #295437) | Cod sursa (job #2336978) | Cod sursa (job #602390)
Cod sursa(job #602390)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, Stack[20], K;
void Print ()
{
for (int i=1; i<=K; ++i)
{
fout << Stack[i] << " ";
}
fout << "\n";
}
void Back (int k)
{
if (k==K+1)
{
Print ();
return;
}
for (int i=Stack[k-1]+1; i<=N; ++i)
{
Stack[k]=i;
Back (k+1);
}
}
int main()
{
fin >> N >> K;
Back (1);
return 0;
}