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