Pagini recente » Cod sursa (job #1382814) | Cod sursa (job #2402624) | Cod sursa (job #1998199) | Cod sursa (job #2377037) | Cod sursa (job #2353249)
#include <bits/stdc++.h>
using namespace std;
#define LMax 20
#define INfile "combinari.in"
#define OUTfile "combinari.out"
ifstream fin (INfile);
ofstream fout (OUTfile);
int sol[LMax], n, k;
void afis()
{
for (int i = 1; i <= k; ++i)
fout << sol[i] << ' ';
fout << '\n';
}
int verif (int h, int poz)
{
if (h < sol[poz - 1])
return 0;
for (int j = 1; j < poz; ++j)
if (sol[j] == h)
return 0;
return 1;
}
void bkt (int poz)
{
if (poz == k + 1)
afis();
else
{
for (int i = 1; i <= n; ++i)
{
if (verif (i, poz) == 1)
{
sol[poz] = i;
bkt (poz + 1);
}
}
}
}
int main()
{
fin >> n >> k;
bkt (1);
return 0;
}