Pagini recente » Cod sursa (job #2845121) | Borderou de evaluare (job #233485) | Cod sursa (job #2157334) | Cod sursa (job #1432515) | Cod sursa (job #2621804)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, v[15], f[15], p;
void afis()
{
for(int i = 1; i <= p; i++)
fout << v[i] << ' ';
fout << '\n';
}
void backt(int k)
{
for(int i = v[k - 1]; i <= n; i++)
{
if(f[i] == 0)
{
v[k] = i;
f[i] = 1;
if(k == p)
afis();
else
backt(k + 1);
f[i] = 0;
}
}
}
int main()
{
fin >> n >> p;
v[0] = 1;
backt(1);
}