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 = 21, 1, 5, 22, 29, 19, 28, 7, 4, 18, 20, 16, 15, 32, 8, 23, 0, 26 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [21, 1, 5, 22, 29, 19, 28, 7, 4, 18, 20, 16, 15, 32, 8, 23, 0, 26] (positions 1..18).