Pagini recente » Borderou de evaluare (job #2609395) | Cod sursa (job #2317203) | Cod sursa (job #841303) | Cod sursa (job #1018121) | Cod sursa (job #196412)
Cod sursa(job #196412)
#include<stdio.h>
int n,m,p[21];
void back_comb(int k)
{
if(k==m+1)
{for(int j=1;j<=m;j++)
printf("%d ",p[j]);
printf("\n");
}
else for(int i=p[k-1]+1;i<=n;i++)
{p[k]=i;
back_comb(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back_comb(1);
return 0;
}