Pagini recente » Cod sursa (job #3195044) | Cod sursa (job #2696948) | Cod sursa (job #2235174) | Cod sursa (job #2885690) | Cod sursa (job #2567949)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define Nmax 50005
#define INF 0x3f3f3f3f
#define MOD 1999999973
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k;
int c[20];
void prnt()
{
for (int i = 1; i <= k; i++)
g << c[i] << " ";
g << '\n';
}
void bkt(int niv)
{
if (niv == k+1)
{
prnt();
}
else
{
for (int i = c[niv-1]+1; i <= n; i++)
{
c[niv]=i;
bkt(niv+1);
}
}
}
int main()
{
f >> n >> k;
bkt(1);
return 0;
}