FFCOMB - Editorial

I think so. Somhow I passed with a barely optimized O(2^n\cdot M) (M being the number of meal combos in the input).

How each mask has 2^(N-k) submasks ?