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 10 distinct integers: A = 4, 6, 9, 0, 2, 10, 8, 17, 13, 12 (positions 1..10).
The task
You are given an array A of 10 distinct integers: A = [4, 6, 9, 0, 2, 10, 8, 17, 13, 12] (positions 1..10).