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 = 5, 22, 26, 17, 24, 35, 3, 6, 7, 28, 33, 13, 27, 2, 30, 18, 34, 31 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [5, 22, 26, 17, 24, 35, 3, 6, 7, 28, 33, 13, 27, 2, 30, 18, 34, 31] (positions 1..18).