Pagini recente » Cod sursa (job #1125000) | Cod sursa (job #757242) | Cod sursa (job #37672) | Cod sursa (job #1003654) | Cod sursa (job #1412741)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[19];
int i, n, k;
int valid(int P)
{
int i;
for(i = 1; i < P; i++)
if(x[i] >= x[P])
return 0;
return 1;
}
int main()
{
f >> n >> k;
i = 1;
do
{
do
{
x[i]++;
if(x[i] > n)
{
x[i] = 0;
i--;
}
else if(valid(i))
i++;
}while(i <= k && i > 0);
if(i > k)
{
for(i = 1; i <= k; i++)
g << x[i] << " ";
g << "\n";
i = k;
}
}while(i > 0);
return 0;
}