Pagini recente » Cod sursa (job #855831) | Cod sursa (job #1856289) | Cod sursa (job #2167579) | Cod sursa (job #291363) | Cod sursa (job #3003856)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NMAX = 21;
int n,p;
int st[NMAX];
void print(int k)
{
for(int i=1;i<=k;++i)
fout << st[i] << ' ';
fout << '\n';
}
void backt(int k)
{
for(int i=st[k-1]+1;i<=n;++i)
{
st[k] = i;
if(k == p)
print(k);
else
backt(k+1);
}
}
int main()
{
fin >> n >> p;
st[0] = 0;
backt(1);
return 0;
}