Pagini recente » Cod sursa (job #3180535) | Cod sursa (job #2406345) | Cod sursa (job #2722516) | Cod sursa (job #2049346) | Cod sursa (job #2682432)
#include<fstream>
using namespace std;
int n,p,x[19],k;
ifstream f ("combinari.in");
ofstream g("combinari.out");
void afisare(int k)
{
for(int i=1;i<=k;i++)
g<<x[i]<<" ";
g<<endl;
}
int valid(int k)
{
if(k>1)
if(x[k]<=x[k-1]) // strict crescatoare
return 0;
return 1;
}
void bkt(int k)
{
int i;
for(i=1;i<=n;i++)
{
x[k]=i;
if(valid(k)==1)
if(k==p)
afisare(k);
else
bkt(k+1);
}
}
int main()
{
f>>n>>p;
bkt(1);
return 0;
}