Write a program that takes a collection of circular discs and prints 1
if some two discs overlap, and 0 if no discs overlap.  The discs
should be read from standard input as a sequence of triples:


x1 y1 r1

...

xn yn rn


In this xi, yi will denote the center of the ith circle and ri its
radius.

Your program should run in time O(nlogn), for n discs.

You are expected to modify the segment intersection program suitably.

due Wednesday March 13, 11:55pm