Pagini recente » Cod sursa (job #208126) | Cod sursa (job #1886551) | Cod sursa (job #2325254) | Cod sursa (job #2640485) | Cod sursa (job #2369813)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k;
int v[20], uz[20];
void print()
{
for (int i = 1; i <= k; i++)
g << v[i] << " ";
g << '\n';
}
void bkt(int p)
{
if(p == k+1)
{
print();
}
else
{
for (int i = v[p-1]+1; i <= n; i++)
{
if(uz[i] == 1) continue;
uz[i]=1;
v[p]=i;
bkt(p+1);
uz[i]=0;
}
}
}
int main()
{
f >> n >> k;
bkt(1);
return 0;
}