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