Pagini recente » Cod sursa (job #1769964) | Istoria paginii runda/aib-uri | Istoria paginii preoni-2008/runda-3/solutii | Istoria paginii utilizator/dianazaharia132nr2 | Cod sursa (job #353129)
Cod sursa(job #353129)
#include<fstream.h>
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[20],m,n;
void afis()
{int i;
for(i=1;i<=m;i++) fout<<st[i]<<" ";
fout<<'\n';
}
void bkt()
{int k,up;
k=1;
st[k]=0;
while(k){up=0;
while(!up&&st[k]<n-m+k) {st[k]++;
up=1;
}
if(up) if(k==m) afis();
else {k++;
st[k]=st[k-1];
}
else k--;
}
}
void main()
{fin>>n>>m;
bkt();
}