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