Pagini recente » Cod sursa (job #1063512) | Cod sursa (job #164307) | Cod sursa (job #944013) | Cod sursa (job #830776) | Cod sursa (job #1904329)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[10],n,k,l;
bool corect(int l)
{
for(int i=1;i<=l-1;i++)
if(v[i]==v[l] || v[i]>v[l]) return 0;
return 1;
}
void afisare(int l)
{
for(int i=1;i<=l;i++)
cout<<v[i]<<" ";
cout<<'\n';
}
void BKT(int l)
{
for(int i=1;i<=n;i++)
{
v[l]=i;
if(corect(l))
{
if(l==k) afisare(k);
else BKT(l+1);
}
}
}
int main()
{
cin>>n>>k;
BKT(1);
return 0;
}