Pagini recente » Cod sursa (job #3270141) | Cod sursa (job #1056702) | Cod sursa (job #1052516) | Cod sursa (job #40121) | Cod sursa (job #1533934)
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,p,v[19];
void afisare()
{
for(int i=1;i<=p;i++)
out<<v[i]<<' ';
out<<'\n';
}
int valid(int k)
{
for(int i=1;i<k;i++)
if(k>1 && v[k]<=v[k-1])
return 0;
return 1;
}
void back(int k)
{
if(k>p)
afisare();
else
for(int i=1;i<=n;i++)
{
v[k]=i;
if(valid(k))
back(k+1);
}
}
int main()
{
in>>n>>p;
back(1);
return 0;
}