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 = 23, 17, 27, 18, 7, 12, 26, 11, 0, 3, 16, 9, 13, 2 (positions 1..14).
The task
You are given an array A of 14 distinct integers: A = [23, 17, 27, 18, 7, 12, 26, 11, 0, 3, 16, 9, 13, 2] (positions 1..14).