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 = 36, 7, 13, 1, 12, 3, 21, 22, 8, 40, 25, 30, 31, 29, 15, 37, 24, 11, 2, 28, 4, 41 (positions 1..22).
The task
You are given an array A of 22 distinct integers: A = [36, 7, 13, 1, 12, 3, 21, 22, 8, 40, 25, 30, 31, 29, 15, 37, 24, 11, 2, 28, 4, 41] (positions 1..22).