Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Beta
On a plane, N points are given. No two points coincide.
Find the triangle with vertices at these points, having the smallest possible perimeter.
Input
First, you read the number N - the number of
points (3 ≤ N ≤ 50), and then N of pairs of real
numbers defining the coordinates of the points are given.
Output
Bring out the three numbers - number of points that should be tops
of triangle whose perimeter is minimal. If there are many,
give any of them.
|
Input
|
Output
|
5
0 0
3.1 0
-2 0.1
1 0
10 10
|
1 3 4
|
Для отправки решений необходимо выполнить вход.
|