Pagini recente » Cod sursa (job #1479226) | Cod sursa (job #1295622) | Cod sursa (job #1712494) | Cod sursa (job #3307538) | Cod sursa (job #1655500)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k;
const int NMAX = 19;
typedef int stiva[NMAX];
stiva st;
int vf = 1;
int ok()
{
if(vf > 1)
if(st[vf] <= st[vf-1])
return 0;
return 1;
}
void afisare()
{
for(int i=1;i<=vf;i++)
out<<st[i]<<" ";
out<<"\n";
}
int main()
{
in>>n>>k;
in.close();
st[vf] = 0;
while(vf)
{
st[vf]++;
if(st[vf] > n)
vf--;
else
{
if(ok())
{
if(vf==k)
afisare();
else
st[++vf] = 0;
}
}
}
out.close();
return 0;
}