Miku and lines
CodeChefOpen on judge ↗
Miku likes geometry. While solving few geometrical problems she got stuck on one, luckily for her Kiku came to rescue and solved her problem. Can you solve it too? Given a line $ y =m x + c $, and a set of $N$ points on Cartesian plane in the form of (Xi , Yi) for each $ 1 \leq i \leq N $. You have to find out the number of pair of points which upon joining will make a line segment that will inte
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.
Sign in to chat with the tutor and save your progress.
Sign in to start