HF RL Explorer

Task: Smallest Number That Cannot Be Formed From Sum of Array Elements

Task: Smallest Number That Cannot Be Formed From Sum of Array Elements: a task in Terminal-Lego-15k (Harbor dataset). Given an array of positive integers, find the smallest positive integer that cannot be represented as the sum of any subset of elements from the array.

The task

Given an array of positive integers, find the smallest positive integer that cannot be represented as the sum of any subset of elements from the array.

Part of PrimeIntellect/Terminal-Lego-15k.