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 = 22, 15, 9, 21, 8, 3, 25, 20, 27, 23, 5, 16, 11, 26 (positions 1..14).
The task
You are given an array A of 14 distinct integers: A = [22, 15, 9, 21, 8, 3, 25, 20, 27, 23, 5, 16, 11, 26] (positions 1..14).