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 = 4, 16, 10, 6, 23, 1, 19, 11, 13, 20, 3, 24, 9, 26 (positions 1..14).
The task
You are given an array A of 14 distinct integers: A = [4, 16, 10, 6, 23, 1, 19, 11, 13, 20, 3, 24, 9, 26] (positions 1..14).