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 10 distinct integers: A = 15, 5, 17, 18, 19, 12, 4, 7, 8, 6 (positions 1..10).
The task
You are given an array A of 10 distinct integers: A = [15, 5, 17, 18, 19, 12, 4, 7, 8, 6] (positions 1..10).