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 = 17, 14, 3, 11, 0, 15, 9, 6, 1, 7 (positions 1..10).
The task
You are given an array A of 10 distinct integers: A = [17, 14, 3, 11, 0, 15, 9, 6, 1, 7] (positions 1..10).