Pagini recente » Cod sursa (job #1957909) | Cod sursa (job #1035975) | Cod sursa (job #2744829) | Cod sursa (job #1702667) | Cod sursa (job #1318268)
//#include<iostream>
#include<fstream>
using namespace std;
ifstream cin("cominari.in");
ofstream cout("combinari.out");
int i,st[100],n,k,p;
void afisare(int p){
for(i=1;i<=p;++i)
cout<<st[i]<<" ";
cout<<endl;
}
bool valid(int p){
int ok=1;
for(i=1;i<p;++i)
if(st[i]==st[p])
ok=0;
return ok;
}
void back(int p){
int pval;
for( pval=st[p-1]+1; pval<=n; ++pval ){
st[p]=pval;
//if(valid(p))
if(p==k) afisare(p);
else back(p+1);
}
}
int main()
{
cin>>n;cin>>k;
back(1);
cin.close();
cout.close();
return 0;
}