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 22 distinct integers: A = 37, 2, 24, 7, 35, 20, 40, 25, 19, 4, 34, 38, 12, 15, 18, 10, 13, 8, 43, 14, 3, 39 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [37, 2, 24, 7, 35, 20, 40, 25, 19, 4, 34, 38, 12, 15, 18, 10, 13, 8, 43, 14, 3, 39] (positions 1..22).