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 = 20, 43, 34, 15, 5, 14, 2, 30, 35, 33, 41, 27, 29, 21, 26, 38, 28, 32, 9, 17, 42, 40 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [20, 43, 34, 15, 5, 14, 2, 30, 35, 33, 41, 27, 29, 21, 26, 38, 28, 32, 9, 17, 42, 40] (positions 1..22).