Tackle a challenging number problem involving integers.
NumbersJam helps you tackle a challenging number problem involving integers. This problem is closely related to one of the hard problems of Computer Science, the problem known as Satisfiability (SAT).
Given some input numbers, all integers, and a target number, also an integer, determine if the target number is reachable by combining the input numbers with arithmetic operations of addition, subtraction, multiplication and division, constrained by only two rules that each input number can be used at most once and that only divisions that produce zero remainders are allowed. The goal is to come as close as possible to the target number.