Pagini recente » Cod sursa (job #1673191) | Cod sursa (job #1796901) | Rating Caciur Florin-Gheorghe (floribun) | Cod sursa (job #1150992) | Cod sursa (job #2202383)
#include <iostream>
#include <fstream>
using namespace std;
int x[50], n, k, p;
ifstream in("combinari.in");
ofstream out("combinari.out");
void afisare()
{
int i;
for(i = 1; i < n; i++)
{
out << x[i] << " ";
}
out << endl;
}
void comb(int p)
{
int i;
if(p == k + 1)
{
afisare();
}
else
{
for(i = x[p - 1] + 1; i <= n - k + p; i++)
{
x[p] = i;
comb(p + 1);
}
}
}
int main()
{
in >> n >> k;
x[0] = 0;
comb(1);
return 0;
}