Pagini recente » Cod sursa (job #870969) | Cod sursa (job #2018258) | Cod sursa (job #1213324) | Cod sursa (job #2333769) | Cod sursa (job #1348032)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, c[20];
bool viz[20];
void afisare()
{
int i;
for (i = 1; i <= k; i++)
fout<<c[i]<<" ";
fout<<'\n';
}
void gen( int i)
{
if ( i == k+1 )
afisare();
else
{
int p;
if (i!=1)
p = c[i-1];
else
p = 1;
for (int j = p; j <= n; j++)
if (viz[j] == 0)
{
viz[j] = 1;
c[i] = j;
gen (i+1);
viz[j] = 0;
}
}
}
int main()
{
fin>>n;
fin>>k;
gen(1);
return 0;
}