Pagini recente » Cod sursa (job #1887782) | Cod sursa (job #2255653) | Cod sursa (job #2791752) | Cod sursa (job #910636) | Cod sursa (job #2544761)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, r[19];
void Back(int p);
int main()
{
fin >> n >> k;
Back(1);
fin.close();
fout.close();
return 0;
}
void Afisare()
{
for (int i = 1; i <= k; ++i)
{
fout << r[i] << ' ';
}
fout << '\n';
}
bool f[19];
void Back(int p)
{
if (p > k) { return Afisare(); }
for (int i = r[p - 1] + 1; i <= n; ++i)
{
r[p] = i;
if (!f[r[p]])
{
f[r[p]] = true;
Back(p + 1);
f[r[p]] = false;
}
}
}