|Online Judge||Problem Set||Authors||Online Contests||User|
There are N points marked on a surface, pair (xi, yi) is coordinates of a point number i. Let’s call a necklace a set of N figures which fulfills the following rules.
Write a program which takes points and constructs a necklace.
The first line of the input contains one integer number N (2 ≤ N ≤ 100). Each of the next N lines contains two real numbers xi, yi (1 000 ≤ xi, yi ≤ 1 000), separated by one space. It is guaranteed that at least one necklace exists.
The output has to contain N lines. A line #i contains real number ri, (0 ≤ ri < 10 000). To avoid potential accuracy problems, a checking program uses the following rules.
4 0 0 10 0 10 10 0 10
7 7 7 7
Northeastern Europe 2004, Western Subregion
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator