Pagini recente » Cod sursa (job #592190) | Cod sursa (job #2062095) | Cod sursa (job #3196934) | Cod sursa (job #1839309) | Cod sursa (job #2805859)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int m, n, x[19];
void bkt()
{
int k = 1;
while (k)
{
if (x[k] < n && k <= m)
{
++x[k];
if (k == m)
{
for (int i = 1;i <= k;++i)
g << x[i] << ' ';
g << '\n';
}
else
{
++k;
x[k] = x[k - 1];
}
}
else
--k;
}
}
int main()
{
f >> n >> m;
bkt();
f.close();
g.close();
return 0;
}