TRIANGLES OF XAVIER

CodeChefOpen on judge ↗

Xavier loves triangles. Currently he is trying to find out, given two sides of a triangle, if the difference between the largest and smallest possible perimeters of the triangle is at least equal to a given value, such that the area of the triangle possible remains maximised in both scenarios. Given t such cases, can you help him find out the number of cases which satisfies the above condition?

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