Pagini recente » Cod sursa (job #3225045) | Cod sursa (job #836983) | Cod sursa (job #2575558) | Cod sursa (job #1342071) | Cod sursa (job #2320533)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,x[20];
void bkt(int);
int main()
{
fin>>n>>k;
bkt(1);
}
int verificare(int p)
{
for(int i=2;i<=p;i++)
if(x[i]<=x[i-1])
return 0;
return 1;
}
void afisare(int p)
{
for(int i=1;i<=p;i++)
fout<<x[i]<<' ';
fout<<'\n';
}
void bkt(int p)
{
for(int i=1;i<=n;i++)
{
x[p]=i;
if(verificare(p))
if(p==k)afisare(p);
else bkt(p+1);
}
}