Pagini recente » Cod sursa (job #3226780) | Cod sursa (job #1091319) | Cod sursa (job #1038129) | Cod sursa (job #1007973) | Cod sursa (job #936112)
Cod sursa(job #936112)
#include <cstdio>
using namespace std;
int n,k,c[20];
void back(int);
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}
void back(int p)
{
if(p==k+1)
{
for(register int i=1; i<=k; ++i)
printf("%d ",c[i]);
printf("\n");
return;
}
for(register int i=c[p-1]+1;i<=n-k+p;++i)
{
c[p]=i;
back(p+1);
}
}