Partition Array into Two Equal Product Subsets
The two products must multiply to the square of the target, so a subset search over bitmasks finds a group whose product is the target.
The two products must multiply to the square of the target, so a subset search over bitmasks finds a group whose product is the target.