Pagini recente » Cod sursa (job #2755902) | Cod sursa (job #230284) | Cod sursa (job #969270) | Cod sursa (job #2634634) | Cod sursa (job #2659559)
//#include <iostream>
#include <fstream>
using namespace std;
int n,a[100],i,sem,kk;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int valid(int k)
{
int sem=1;
for(int j=1;j<k;j++)
{
if(a[j]==a[k] || a[j]>a[k])
{
sem=0;
}
}
return sem;
}
void afis()
{
for(i=1;i<=kk;i++)
cout<<a[i]<<' ';
cout<<'\n';
}
void backt (int k, int nr)
{
if(k>nr)
{
afis();
}
else
{
for(int j=1; j<=n;j++)
{
a[k]=j;
if(valid(k)==1)
{
a[k]=j;
backt(k+1,nr);
}
}
}
}
int main()
{
cin>>n>>kk;
backt(1,kk);
return 0;
}