Cod sursa(job #214103)
Utilizator | Gagos Radu Vasile Gagos | Data | 12 octombrie 2008 19:11:30 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<stdio.h>
#define dmax 1<<8
int n,k,biti[dmax];
void afisare(int mask);
int main()
{
long i;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
biti[1]=1;
for(i=2;i<(1<<n);++i){
biti[i]=biti[i>>1]+(i&1);
if(biti[i]==k)
afisare(biti[i]);
}
fcloseall();
return 0;
}
void afisare(int mask)
{
int af=1;
while(mask){
if(mask&1)
printf("%d ",af);
af++;
mask>>=1;
}
printf("\n");
}