Find Triangles

CodeChefOpen on judge ↗

###FIND TRIANGLES: Students in the class are making noise. So, the teacher assigned a task to the students. The task is as follows: There are 2 non intersecting lines. First line has $M$ points and second line has $N$ points on them. Find the number of triangles formed by the points on those two lines. (Only find triangles formed by the points on the given lines i.e., all the vertices of

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