Nice Quadrangles

CodeChefRating 1680Open on judge ↗

There are n points with integer coordinates. We can form different quadrangles out of them by taking four different points and connecting them with lines. Let’s call a quadrangle ABCD nice if and only if: - Ax > 0 and Ay > 0; - Bx > 0 and By 0; - ABCD has an integer area. Your task is to count all different nice quadrangles that can be formed on the given points. Input The first line of inpu

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