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, 1, 12, 25, 16, 15, 11, 24, 34, 6, 4, 7, 21, 0, 32, 19, 28, 13 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [5, 1, 12, 25, 16, 15, 11, 24, 34, 6, 4, 7, 21, 0, 32, 19, 28, 13] (positions 1..18).