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 = 34, 30, 3, 25, 35, 14, 39, 11, 15, 9, 1, 16, 17, 5, 0, 21, 23, 32, 43, 36, 40, 7 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [34, 30, 3, 25, 35, 14, 39, 11, 15, 9, 1, 16, 17, 5, 0, 21, 23, 32, 43, 36, 40, 7] (positions 1..22).