Pagini recente » Cod sursa (job #248832) | Monitorul de evaluare | Istoria paginii utilizator/eugenstoica | Cod sursa (job #564694) | Cod sursa (job #292076)
Cod sursa(job #292076)
#include<fstream.h>
ifstream f("combinari.in");
ofstream g("combinari.out");
short st[19],N,k=1,K;
void afis()
{for(short i=1;i<=K;++i)
g<<st[i]<<' ';
g<<'\n';}
short succ()
{if(st[k]<N)
{++st[k];
return 1;}
else return 0;}
void back()
{short s;
while(k>0)
{s=succ();
if(s)
if(k==K)afis();
else
st[++k]=st[k-1];
else
--k;}
}
int main()
{f>>N>>K;
back();
return 0;
}