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