# POJ 2002 Squares

If you use binary search, you should quick sort the point set, the time complexity is $$O(n^2\log {n})$$. If you use a good hash, the time complexity can be $$O(n^2)$$.