Cipher

CodeChefOpen on judge ↗

Problem description Divjot is a weird kid, he loves mathematics and athletics. He practice athletics in the morning at the local ground of his community. The ground is of infinite length with a wall of height H at one end. Since he loves mathematics he wonder how many right angled triangles are possible with height H and base being his distance from the wall(Base and hypotenuse should be integer

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