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 = 20, 35, 11, 14, 7, 13, 12, 23, 9, 8, 21, 1, 0, 28, 29, 32, 27, 24 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [20, 35, 11, 14, 7, 13, 12, 23, 9, 8, 21, 1, 0, 28, 29, 32, 27, 24] (positions 1..18).