【TRICK】[0,n)中所有大小为k的子集的方法

int comb = (1 << k) - 1;
while (comb < (1<<n)) {
    int x = comb & -comb, y = comb + x;
    comb = (((comb & ~y)/x)>>1) | y；
}