Pagini recente » Cod sursa (job #153534) | Cod sursa (job #405560) | Cod sursa (job #1668481) | Cod sursa (job #1164057) | Cod sursa (job #153872)
Cod sursa(job #153872)
#include <stdio.h>
int i,j,n,k,nr,t;
int v[20];
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
for (i=1; i<=n; i++) v[i]=1;
for (i=0; i<=(1<<n)-1; i++)
{
v[n]--;j=n+1;
while (j>1)
{
j--;
if (v[j]<0)
{
v[j]=1;
t=j-1;
while (v[t]==0 && t>0) {v[t]=1;t--;}
v[t]--;
}
}
nr=0;
for (j=1; j<=n; j++) if (v[j]==1) nr++;
if (nr==k)
{
for (j=1; j<=n; j++)
if (v[j]==1) printf("%d ",j);
printf("\n");
}
}
return 0;
}