Pagini recente » Cod sursa (job #2458606) | Cod sursa (job #1956552) | Cod sursa (job #1817636) | Cod sursa (job #625129) | Cod sursa (job #1689412)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
unsigned n, k, x[20];
void afisare(unsigned k)
{
for(unsigned i = 1; i <= k; i++)
fout << x[i] << " ";
fout << "\n";
}
int cond(unsigned poz)
{
for(unsigned i = 1; i < poz; i++)
if(x[poz] == x[i])
return 0;
for(unsigned i = 1; i < poz; i++)
if(x[poz] < x[i])
return 0;
return 1;
}
void combinari(unsigned poz)
{
for(unsigned i = 1; i <= n; i++)
{
x[poz] = i;
if(cond(poz))
{
if(poz == k)
afisare(k);
else
combinari(poz + 1);
}
}
}
int main()
{
fin >> n >> k;
combinari(1);
return 0;
}