Chef and His Matchsticks

CodeChefOpen on judge ↗

Chef has a certain number of matchsticks which have various sizes. Chef is interested in knowing number of such matchsticks that can be a part of a right-angled triangle.The triangles must be made using only the matchsticks present. Any matchstick can be used only once for a particular triangle but a same matchstick can be used in many triangles. Input - The first line of the input contains a

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.

voice by Sarvam AI