given a positive number as a dividend, find out a subset from a given array, so that can get the minimum remainder

Question

here is some cases: given number: 31 given array: [4, 5, 6, 7] then the result subset will be [5] or [6] as 31 divide 5 or 6, the remainder is 1, is the minimum one.

but