Pagini recente » Cod sursa (job #2339556) | Cod sursa (job #3161871) | Rating tudor frent (tudorfrent1) | Istoria paginii runda/7953532771521155 | Cod sursa (job #2350096)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,ST[20],p;
void tipar(int k)
{
int i;
for (i=1;i<=k;i++)
fout<<ST[i]<<" ";
fout<<"\n";
}
int valid(int k)
{
int i;
for (i=1;i<k;i++)
if (ST[k]<=ST[i])
return 0;
return 1;
}
void back(int k)
{
int i;
for (i=1;i<=n;i++)
{
ST[k]=i;
if (valid(k))
if (k==p)
tipar(k);
else
back(k+1);
}
}
int main()
{
fin>>n>>p;
back(1);
return 0;
}