Smallest Square

CodeChefOpen on judge ↗

[P19] (https://www.prayatna.org.in) was a busy guy, and with only less than a week left for the event, it was impossible to catch hold of him! Hence, he wants your assistance in solving this simple problem. You're given $N$ points, each consisting of an $x$ coordinate and a $y$ coordinate. You're also given $Q$ queries, where each query consists of a value $K$. For each query, you need to find

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