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