- Category:
- Algorithm
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2013-12-10
- Downloads:
- 0 Times
- Uploaded by:
- 徐冬胜
Description: ★ Problem Description:
Gives the N-dimensional point in the plane, find the minimum distance two points right. The problem is defined as the distance of their straight
Line distance. E.g., (0,0) (3,4) distance is 5.
★ Data input:
Multiple sets of data, for each set of data, the first line is a number N represents the number of points. Description when N = 0
Enter the ending. After N lines, each line has two floating-point numbers x_i, y_i represents the i-th coordinate point. (1 <= N <= 10000
0,0 <= | x_i |, | y_i | <= 10 ^ 9)
★ resulting output:
Output a float that is the nearest point on the distance divided by 2, to retain two decimal places (rounded).
To Search:
File list (Check if you may need any files):
x.txt
Download