Chef and new weapon
CodeChefOpen on judge ↗
There are $N$ targets placed in a field, the plane of the field is cartesian. Each target is associated with coordinates $(x, y)$. Chef has placed his new weapon at the point $(x_0, y_0)$. In one shot it can destroy all the targets on some line that crosses point $(x_0, y_0)$. Determine the number of shots required to destroy all targets. ###Input - The first line contains $N$ the number of targe
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