Prototype: implement prototype(long[] sizes, int amount) returning int with a direct baseline.
Final: implement solve(long[] sizes, int amount) with the mechanism and bounds described above. Sizes are unlimited positive integers. Return minimum count summing exactly to amount or -1 when impossible. Zero amount returns zero, even for empty sizes. Reject negative amount and all nonpositive sizes before computing. Both stages have the same observable contract. The prototype may use the simpler method; final must use the target data structure.
All methods are static members of Exercise.
Drag or use the arrow keys to resize. Home collapses the question; End collapses the editor. Enter or double-click resets the split.
Loading editor…
Loading editor…
No results yet.
Complete the starter code, then run the checks.
Results and errors will appear here.
Java runs on this device with CheerpJ 4.3.