construct/rlve distinct subset sum permutation
construct/rlve distinct subset sum permutation: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). You are given an array A of 18 distinct integers: A = 19, 24, 5, 21, 35, 17, 2, 11, 23, 27, 30, 9, 32, 25, 10, 33, 20, 22 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [19, 24, 5, 21, 35, 17, 2, 11, 23, 27, 30, 9, 32, 25, 10, 33, 20, 22] (positions 1..18).