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 = 16, 36, 2, 8, 37, 28, 42, 35, 31, 30, 33, 20, 18, 40, 25, 19, 6, 39, 27, 13, 12, 4 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [16, 36, 2, 8, 37, 28, 42, 35, 31, 30, 33, 20, 18, 40, 25, 19, 6, 39, 27, 13, 12, 4] (positions 1..22).