Problem 3444 · Hard

Minimum Increments for Target Multiples in an Array

Each number covers a subset of targets at the cost of raising it to the next multiple of their lcm, tracked by a bitmask DP.

Open the interactive visualisation