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