Pagini recente » Cod sursa (job #1168368) | Cod sursa (job #1558026) | Cod sursa (job #2858737) | Cod sursa (job #1507976) | Cod sursa (job #2022867)
#include <iostream>
#include <fstream>
#include <cstdio>
#define NMax 19
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[NMax], n, p;
bool fol[NMax];
void afisare()
{
for(int i = 1; i <= p; ++i)
g << st[i] << " ";
g << '\n';
}
void back(int k)
{
for(int i = st[k - 1] + 1; i <= n; ++i)
{
if(!fol[i])
{
fol[i] = true;
st[k] = i;
if(k == p) afisare();
else back(k + 1);
fol[i] = false;
}
}
}
int main()
{
f >> n >> p;
back(1);
return 0;
}