Leetcode 3444. Minimum Increments for Target Multiples in an Array

Given nums and a small set of targets (<=4), compute the minimum total +1 increments to transform some elements of nums so that each target has at least one multiple in nums; treat each number’s cost to become a multiple of any subset’s lcm and use bitmask DP to choose numbers/subsets minimizing the sum.