Pagini recente » Cod sursa (job #1458298) | Cod sursa (job #1394123) | Cod sursa (job #710409) | Cod sursa (job #647462) | Cod sursa (job #1843135)
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int n,k,V[19];
void Show()
{
for (int i=1;i<=k;i++)
{
out<<V[i]<<' ';
}
out<<'\n';
}
int Solutie (int arg)
{
return (arg==k);
}
int Valid (int arg)
{
for (int i=1;i<arg;i++)
{
if (V[i]>=V[arg])
return 0;
}
return 1;
}
int Back (int arg)
{
for (int i=1;i<=n;i++)
{
V[arg]=i;
if (Valid (arg))
{
if (Solutie(arg))
Show();
else
Back (arg+1);
}
}
}
int main()
{
in>>n>>k;
Back(1);
return 0;
}