Pagini recente » Cod sursa (job #2042669) | Cod sursa (job #227049) | Cod sursa (job #604325) | Cod sursa (job #3120836) | Cod sursa (job #1377066)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
short n,k,x[20];
void afisare()
{
for(short i=1;i<=k;i++)
g<<x[i]<<" ";
g<<'\n';
}
int valid(int v)
{
if(x[v-1]>=x[v])return 0;
return 1;
}
void bkt()
{short v=1;
while(v)
{x[v]++;
if(x[v]>n){x[v]=0;v--;}
else
if(valid(v))
if(v==k)afisare();
else v++;
}
}
int main()
{
f>>n>>k;
bkt();
return 0;
}