Cut the Trees
CodeChefOpen on judge ↗
###Problem Statement You are given N trees, where the length of each tree is a positive integer. A cut operation is performed on the trees such that all of them are reduced by the length of the smallest tree. Suppose we have six trees of the following lengths: 5 4 4 2 2 8 Then, in one cut operation we make a cut of length 2 from each of the six trees. For the next cut operation four trees ar
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start