Pagini recente » Cod sursa (job #2269069) | Cod sursa (job #1792023) | Cod sursa (job #393806) | Cod sursa (job #1736271) | Cod sursa (job #304974)
Cod sursa(job #304974)
#include<stdio.h>
int n,k,i,j,l,gata,c[20];
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=k;++i)
{
c[i]=i;
printf("%d ",i);
}
printf("\n");
while(gata==0)
{
for(i=k;i>0 && (c[i]==(n-k+i));--i);
if(i==0)
gata=1;
else
{
c[i]++;
for(j=i+1;j<=k;++j)
c[j]=c[j-1]+1;
for(l=1;l<=k;++l)
printf("%d ",c[l]);
printf("\n");
}
}
return 0;
}