Triangle Revisited

CodeChefOpen on judge ↗

Cody is busy in making triangles, so he has got another problem here, there are a set of given integral points on a 2-D plane. Johnny needs to find out how many triangles can be drawn using the set of given points. Input First line of input consists of ‘t’ (1Output The output must contain ‘n’ lines of output, with 1 integer in each line. The integer is the number of possible triangles that coul

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