M-gon
Hard
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
Given N distinct points on the plane and a positive integer M. Required to find the maximum area nonsingular M-gon without self-intersections and self-tangencies, whose vertices are some of the given N points.
Input
In the first line of input contains space-separated two numbers: M and N (3 ≤ M, N ≤ 10). In the next N lines through space are N pairs of real numbers: x_1, y_1, x_2, y_2, …, x_N, y_N – coordinates of points on the plane.
Output
In the first line of the output file you want to display the desired area of the M-gon, with an accuracy of one digit after the decimal point. If neither M-gon with these properties can not be constructed, then the output file should contain only the number 0.
Examples
Input #1
Answer #1
Submissions 134
Acceptance rate 4%