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 = 0, 24, 6, 26, 21, 7, 2, 16, 27, 18, 4, 22, 13, 25 (positions 1..14).
The task
You are given an array A of 14 distinct integers: A = [0, 24, 6, 26, 21, 7, 2, 16, 27, 18, 4, 22, 13, 25] (positions 1..14).