HF RL Explorer

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 = 9, 13, 12, 16, 3, 18, 11, 10, 15, 0 (positions 1..10).

The task

You are given an array A of 10 distinct integers: A = [9, 13, 12, 16, 3, 18, 11, 10, 15, 0] (positions 1..10).

Part of amphora/MathConstructOptimize-Envs-harbor.