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 = 26, 0, 17, 23, 18, 27, 1, 19, 8, 32, 22, 7, 2, 31, 6, 29, 11, 34 (positions 1..18).
The task
You are given an array A of 18 distinct integers: A = [26, 0, 17, 23, 18, 27, 1, 19, 8, 32, 22, 7, 2, 31, 6, 29, 11, 34] (positions 1..18).