Pagini recente » Cod sursa (job #1342914) | Cod sursa (job #1321653) | Cod sursa (job #201240) | Cod sursa (job #367787) | Cod sursa (job #1466864)
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[18];
int n, i, p;
int valid (int k)
{
int i;
for (i=1; i<k; i++)
if (x[i] >= x[k])
return 0;
return 1;
}
int main ()
{
f >> n >> p;
for (i=1; i<=p; i++)
x[i] = 0;
i = 1;
do
{
do
{
x[i]++;
if (x[i] > n)
{
x[i] = 0;
i--;
}
else
if (valid(i))
i++;
}
while (i<=p && i>0);
if (i > p)
{
for (i=1; i<=p; i++)
g << x[i] << " ";
g << "\n";
i = p;
}
}
while (i > 0);
return 0;
}