Pagini recente » Cod sursa (job #2714237) | Cod sursa (job #2652642) | Cod sursa (job #1188518) | Cod sursa (job #946301) | Cod sursa (job #2175937)
#include <iostream>
#include <fstream>
using namespace std;
const int M = 10e3;
ifstream fcin("combinari.in");
ofstream fcout("combinari.out");
int n, k, x[M];
bool used[M];
void kiir()
{
for (int i = 0; i < k; ++i)
fcout << x[i] << ' ';
fcout << '\n';
}
void komb(int p, int a)
{
if (p == k)
{
kiir();
return;
}
for (int i = a; i <= n; ++i)
if (!used[i])
{
x[p] = i;
used[i] = true;
komb(p + 1, i + 1);
used[i] = false;
}
}
int main()
{
fcin >> n >> k;
int p = 0;
komb(p, 1);
}