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