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 = 21, 7, 8, 17, 13, 2, 19, 14, 4, 27, 10, 20, 26, 6 (positions 1..14).
The task
You are given an array A of 14 distinct integers: A = [21, 7, 8, 17, 13, 2, 19, 14, 4, 27, 10, 20, 26, 6] (positions 1..14).