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 = 7, 17, 38, 26, 3, 24, 33, 2, 28, 8, 6, 41, 25, 1, 14, 35, 18, 21, 43, 36, 5, 16 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [7, 17, 38, 26, 3, 24, 33, 2, 28, 8, 6, 41, 25, 1, 14, 35, 18, 21, 43, 36, 5, 16] (positions 1..22).