Pagini recente » Cod sursa (job #2231946) | Cod sursa (job #2668853) | Cod sursa (job #2348733) | Cod sursa (job #1780720) | Cod sursa (job #1327514)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k, sol[20],p;
bool folosit[20];
void afisare()
{
for(int i=1; i<=k; i++)
out<<sol[i]<<" ";
out<<"\n";
}
void bkt(int p)
{
if(p-1==k)
afisare();
else
for(int i=1+sol[p-1]; i<=n; i++)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
in>>n>>k;
bkt(1);
return 0;
}