Pagini recente » Cod sursa (job #2423412) | Cod sursa (job #2423419) | Cod sursa (job #2423415) | Monitorul de evaluare | Cod sursa (job #1678165)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, sol[100], p;
void display()
{
for(int i = 1; i <= p; ++i)
{
fout << sol[i] << " ";
}
fout << endl;
}
void bkt(int k)
{
if(k == p+1)
{
display();
return;
}
else
{
for(int i = sol[k-1] + 1; i <= n; ++i)
{
sol[k] = i;
bkt(k+1);
}
}
}
int main(void)
{
fin >> n >> p;
sol[0] = 0;
bkt(1);
return 0;
}