trougao
N different points with integer coordinates are given in a plane. You have to write a program that computes the optimal triangle whose vertices are any three points of given N. However, your program must choose these three points in such a way that it maximizes the number of points that belong to the triangle they form. A point belonging to the triangle's sides or its vertices also counts.
InputThe first line of standard input gives a number N (3 <= N <= 60). In each of the next N lines there will be two integers X and Y (-32000 <= X,Y <= 32000) that will represent the coordinates of the given points.
OutputTo the standard output, output only one integer that yields the maximum number of N points given in the input that belong to the best selected triangle.
Input:
Output:
5
1 1
2 1
3 1
2 2
2 0Output:
4Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.