Pagini recente » Cod sursa (job #2656691) | Cod sursa (job #1479190) | Cod sursa (job #3127751) | Cod sursa (job #1486180) | Cod sursa (job #1419547)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[9], i, j, n, k;
bool valid(int h)
{
int i = 1;
for (; i < h; i++)
if (a[i] >= a[h])
return false;
return true;
}
int main()
{
f >> n >> k;
i = 1;
do
{
do
{
a[i]++;
if (a[i] > n)
a[i] = 0, i--;
else if (valid(i))
i++;
}while (i <= k && i > 0);
if (i == k+1)
{
int j;
for (j = 1; j <= k; j++)
g << a[j] << " ";
g << "\n";
i = k;
}
}while (i > 0);
return 0;
}