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 = 24, 5, 32, 33, 2, 14, 25, 19, 39, 28, 9, 4, 29, 11, 12, 43, 6, 27, 40, 7, 10, 26 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [24, 5, 32, 33, 2, 14, 25, 19, 39, 28, 9, 4, 29, 11, 12, 43, 6, 27, 40, 7, 10, 26] (positions 1..22).