Pagini recente » Cod sursa (job #1750836) | Cod sursa (job #2050824) | Cod sursa (job #1692175) | Cod sursa (job #2957049) | Cod sursa (job #1387503)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,x[19],k,K;
void afisare()
{
for(int i=1;i<=k;++i) g<<x[i]<<" ";
g<<'\n';
}
int cc( int k )
{if(k>1)if(x[k]<=x[k-1]) return 0;
return 1;
}
void bk()
{k=1;x[k]=0;
while(k>0)
{while(x[k]<n)
{x[k]++;
if(cc(k))if(k==K)afisare();
else x[++k]=0;
}
k--;}
}
int main()
{
f>>n>>K;
bk();
return 0;
}