Pagini recente » Cod sursa (job #1430800) | Cod sursa (job #1057298) | Cod sursa (job #1936531) | Cod sursa (job #2385747) | Cod sursa (job #1254096)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,q;
int p[20];
void afisare()
{
for(int i=1;i<=q;i++)
out<<p[i]<<" ";
out<<"\n";
}
void back(int k)
{
if(k==q+1)
{
afisare();
}
else
{
for (int i = p[k - 1] + 1; i <= n; ++i) {
p[k] = i;
back(k + 1);
}
}
}
int main()
{
in>>n>>q;
back(1);
return 0;
}