CodeForces 257C. View Angle

C. View Angle

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

The first line contains a single integer n (1 ≤ n ≤ 105) — the number of mannequins.

Next n lines contain two space-separated integers each: xi, yi (|xi|, |yi| ≤ 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

Print a single real number — the value of the sought angle in degrees. The answer will be considered valid if the relative or absolute error doesn't exceed 10 - 6.

Examples

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

Note

Solution for the first sample test is shown below:

Solution for the second sample test is shown below:

Solution for the third sample test is shown below:

Solution for the fourth sample test is shown below:

思路：求出每个点与x正半轴的夹角，排序，取相邻的两点夹角最小的角

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define eps 1e-10
using namespace std;
double a[100010];
int main()
{
	int n,i,j;
	double x,y; 
	while(scanf("%d",&n)!=EOF)
	{
		for(i=1;i<=n;i++)
		{
			scanf("%lf%lf",&x,&y);
		    if(x==0)
		    {
		    	if(y>0)//该点为y的正半轴 
		    	a[i]=90;
		    	else//y的负半轴 
		    	a[i]=270;
			}
			else
			{
				a[i]=atan(y/x)*180/3.1415926535797;//转换为角度 
				if(fabs(a[i])<=eps)//该点接近坐标轴 
				{
					if(x<0)//接近x的负半轴 
					a[i]=180;
				}
				else if(a[i]<=eps)//该点位于第二和第四象限 
				{
					if(x>0)//该点位于第四象限 
					a[i]+=360;
					else //该点位于第二象限 
					a[i]+=180;
				}
				else if(x<0) //该点位于第三象限 
				    a[i]+=180;
			}
	    }
		sort(a+1,a+n+1);
		double minn=a[n]-a[1];
		for(i=1;i<n;i++)
		{
			if(minn>(360-(a[i+1]-a[i])))
			minn=(360-(a[i+1]-a[i]));
		}
		printf("%lf\n",minn);
	}
	return 0;
}