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 = 33, 13, 14, 26, 19, 41, 34, 36, 28, 2, 31, 0, 16, 17, 11, 38, 18, 15, 10, 23, 5, 30 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [33, 13, 14, 26, 19, 41, 34, 36, 28, 2, 31, 0, 16, 17, 11, 38, 18, 15, 10, 23, 5, 30] (positions 1..22).