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 = 6, 26, 10, 14, 3, 21, 24, 30, 35, 5, 33, 11, 4, 32, 7, 12, 25, 31 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [6, 26, 10, 14, 3, 21, 24, 30, 35, 5, 33, 11, 4, 32, 7, 12, 25, 31] (positions 1..18).