Subsets Using Bitmask

Given n distinct integers, print the sum of every subset, in the order of mask values 0 to 2^n - 1 (bit i selects nums[i]).

1 <= n <= 15