Yesterday i was participating in a contest and faced a nice geometry problem named View Angle. After the contest i managed to solve this problem and here are the problem statement and my solution.

Flatland has recently introduced a new type of an eye check for the driver's licence. The check goes like that: there is a plane with mannequins standing on it. You should tell the value of the minimum angle with the vertex at the origin of coordinates and with all mannequins standing inside or on the boarder of this angle. As you spend lots of time "glued to the screen", your vision is impaired. So you have to write a program that will pass the check for you.

**Input**

*n*(1 ≤

*n*≤ 10

^{5}) — the number of mannequins. Next

*n*lines contain two space-separated integers each:

*x*

_{i},

*y*

_{i}(|

*x*

_{i}|, |

*y*

_{i}| ≤ 1000) — the coordinates of the

*i*-th mannequin. It is guaranteed that the origin of the coordinates has no mannequin. It is guaranteed that no two mannequins are located in the same point on the plane.

**Output**

^{ - 6}.

**Sample test(s)**

**Input**

2 2 0 0 2

**Output**

90.0000000000

**Input**

3 2 0 0 2 -2 2

**Output**

135.0000000000

**Input**

4 2 0 0 2 -2 0 0 -2

**Output**

270.0000000000

**Input**

2 2 1 1 2

**Output**

36.8698976458

Solution for first test case

## No comments:

## Post a Comment