2001 Canadian Computing Competition, Stage 1
Problem S4: Cookies
Making chocolate chip cookies involves mixing flour, salt, oil, baking soda and chocolate chips to form dough which is rolled into a plane. Circles are cut from the plane, placed on a cookie sheet, and baked in an oven for about twenty minutes. When the cookies are done, they are removed from the oven and allowed to cool before being eaten.
We are concerned here with the process of cutting a single round cookie that contains all the chocolate chips.
Once the dough has been rolled, each chip is visible in the planar dough, so we need simply to find a cookie cutter big enough to circle all the chips.
What is the diameter of the smallest possible round cookie containing all the chips?
Input consists of a positive integer n not greater than 10, followed by n lines of input.
Each line gives the coordinates of one chocolate chip on the plane.
Each coordinate is an integer in the range [0,1000].
Output consists of a single real number, the diameter of the cookie rounded to two decimal places.
Sample Input 1
4 1 1 1 0 0 1 0 0
Sample Output 1
Sample Input 2
3 1 1 10 0 0 0
Sample Output 2
Point Value: 10
Time Limit: 2.00s
Memory Limit: 16M
Added: Sep 27, 2008
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3
*Phew* Now that we've got that aside, maybe you're not considering the fact that there can be obtuse angles formed by a set of three points. IN that case, the maximum diameter isn't what everyone has been looking up to find a formula for.