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