Pagini recente » Cod sursa (job #2618555) | Cod sursa (job #1482985) | Cod sursa (job #2614447) | Cod sursa (job #753992) | Cod sursa (job #2474696)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int sol[20];
void Read()
{
fin >> n >> k;
fin.close();
}
void afisare()
{
for(int i = 1; i <= k; i++)
fout << sol[i] << " ";
fout << endl;
}
void bkt(int p)
{
for(int i = sol[p - 1] + 1; i <= n; i++)
{
sol[p] = i;
if(p == k)
afisare();
else bkt(p + 1);
}
}
int main()
{
Read();
bkt(1);
return 0;
}