Pagini recente » Cod sursa (job #1907046) | Cod sursa (job #1862045) | Cod sursa (job #2463989) | Cod sursa (job #2599086) | Cod sursa (job #1985439)
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,k;
int p[20];
void afisare()
{
for (int i=1; i<=k; i++)
fo<<p[i]<<" ";
fo<<"\n";
}
void bkt(int poz)
{
if (poz==k+1)
{
afisare();
return;
}
for (int i=p[poz-1]+1; i<=n; i++)
{
p[poz]=i;
bkt(poz+1);
}
}
int main()
{
fi>>n>>k;
bkt(1);
fi.close();
fo.close();
return 0;
}