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