Triangles
CodeChefOpen on judge ↗
You are given 3 sticks of length $a$, $b$ and $c$. You would like to form a triangle (with positive area) using those sticks. Since, the initial sticks might not be able to form a triangle, we can choose any stick and increase its length by $1$. This operation can be performed any number of times. You need to find the minimum number of operations to be performed to get a triangle (with positive
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