Pagini recente » Cod sursa (job #2788025) | Cod sursa (job #2197139) | Cod sursa (job #217071) | Cod sursa (job #360970) | Cod sursa (job #788561)
Cod sursa(job #788561)
#include <cstdio>
int n,k,x[20];
void next_comb(int p)
{
if(x[p]+1<=p+n-k)
{
x[p]++;
return;
}
next_comb(p-1);
x[p]=x[p-1]+1;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
for(int i=1;i<=k;i++)x[i]=i;
do{
for(int i=1;i<=k;i++)printf("%d ",x[i]);
printf("\n");
next_comb(k);
}while(x[0]==0);
return 0;
}