 All Contests
 ProjectEuler+
 Project Euler #252: Convex Holes
Project Euler #252: Convex Holes
Project Euler #252: Convex Holes
_{This problem is a programming version of Problem 252 from projecteuler.net}
Given a set of points on a plane, we define a convex hole as a strictly convex polygon such that:
 the vertices are from the set of given points;
 the polygon is convex;
 none of the elements of the given set lie in the interior of the polygon. Nonvertex elements from the given set may lie on the boundary;
 no three consecutive vertices are colinear.
As an example, the image below shows a set of twenty points and a few such convex holes. The convex hole shown as a red heptagon has an area equal to square units, which is the highest possible area for a convex hole on the given set of points.
For our example, we used the first points , for , produced with the pseudorandom number generator (given and ):

i.e. , âˆ’, âˆ’â€‰âˆ’, â€¦
Given integers , and , generate ordered pairs with the pseudorandom sequence with parameters and . If a pair appears more than once, remove all but one occurrence. What is the maximum area of a convex hole with vertices from this set of points? How many different convex holes are there?
Input Format
Each test file contains lines containing the integer values of , and .
Constraints
Output Format
Print your solution in two lines. On the first line print the maximum convex hole area with exactly one digit after the decimal point. On the second line print the integer value of the number of convex holes.
Sample Input 0
50
290797
50515093
Sample Output 0
584388.5
16186
Explanation 0
All of the generated points are unique. The largest area convex hole has area and there are different convex holes.