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, 1, 26, 25, 33, 0, 20, 34, 11, 32, 31, 9, 35, 2, 30, 8, 16, 27 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [19, 1, 26, 25, 33, 0, 20, 34, 11, 32, 31, 9, 35, 2, 30, 8, 16, 27] (positions 1..18).