Pagini recente » Cod sursa (job #1368984) | Cod sursa (job #82996) | Cod sursa (job #1818631) | Cod sursa (job #1217576) | Cod sursa (job #1740477)
#include <iostream>
#include <cstdio>
using namespace std;
int n,p,sol[100],viz[100];
void wr()
{
for(int i=1;i<=p;i++)
printf("%d ", sol[i]);
printf("\n");
}
void backt(int k)
{
if(k==p+1)
{wr();
return;}
for(int v=sol[k-1]+1;v<=n-p+k;++v)
{
sol[k]=v;
backt(k+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &p);
backt(1);
return 0;
}