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