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 14 distinct integers: A = 15, 11, 25, 4, 0, 10, 17, 16, 19, 3, 24, 9, 21, 22 (positions 1..14).
The task
You are given an array A of 14 distinct integers: A = [15, 11, 25, 4, 0, 10, 17, 16, 19, 3, 24, 9, 21, 22] (positions 1..14).