Pagini recente » Cod sursa (job #580426) | Cod sursa (job #1535823) | Cod sursa (job #861400) | Cod sursa (job #1632195) | Cod sursa (job #235685)
Cod sursa(job #235685)
#include <fstream>
using namespace std;
int n,k;
int p;
int st[20];
fstream fin ("combinari.in",ios::in);
fstream fout("combinari.out",ios::out);
void citire(void){
fin>>n>>k;
}
int as(){
if (p<k)
return 1;
return 0;
}
void print_it(){
for (int i=1;i<=k;i++)
fout<<st[i]<<" ";
fout<<endl;
}
void bt(){
p=1;
st[1]=1;
while (p){
if (p==k && st[p]<=n) {print_it();
st[p]++;
}
else {
if (p<k && st[p]<=n-k+p){
p++;
st[p]=st[p-1]+1;
}
else{
st[p]=0;
p=p-1;
st[p]++;
}
}
}
}
int main(){
citire();
bt();
}