Pagini recente » Cod sursa (job #1731675) | Cod sursa (job #3131120) | Cod sursa (job #1242633) | Cod sursa (job #132820) | Cod sursa (job #1443261)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[19];
int n, k;
bool aparut[19];
void bkt(int x, int nr)
{
int i;
if (nr == k+1)
{
for (i = 1; i <= k; i++)
g << a[i] << " ";
g << "\n";
return;
}
for (i = x; i <= n; i++)
if (!aparut[i])
{
a[nr] = i;
aparut[i] = true;
bkt(i+1, nr+1);
aparut[i] = false;
}
}
int main()
{
f >> n >> k;
bkt(1, 1);
return 0;
}