Codeforces 257C：View Angle（思维+数学+atan2函数）

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:

题目大意：给你一些点的坐标，问你把这些点包围的最小角度为多少。

解题思路：逆思维，观察可知黄色区域内有点，白色部分没有点，那么360-白色部分的角度就得到了黄色部分的角度，且每个黄色区域的两边上的两点肯定是相邻的；要使黄色夹角最小，那么白色的夹角得最大，求出最大的相邻点的角度，用360-这个角度即可。atan2在tan（a/b），b=0的情况下也能使用。

代码如下：

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define PI acos(-1.0)
double jiao1[100010];//每个点与x轴正方向夹角 
double jiao2[100010];//两个相邻点的夹角 
bool cmp(double a,double b)
{
	return a<b;
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)//输入坐标，并求其与x轴正方向夹角，夹角介于0~360 
	{
		double a,b;
		scanf("%lf%lf",&a,&b);
		double tmp=atan2(b,a)*180.0/PI;//角度/180=弧度/PI--->角度=弧度*180/PI 
		if(tmp<0)//atan2求出的范围为-180~180，将负的转化成正的 
		{
			tmp=tmp+360.0;
		}
		jiao1[i]=tmp;
	}
	sort(jiao1,jiao1+n,cmp);//将夹角排序 
	for(int i=0;i<n-1;i++)
	{
		jiao2[i]=jiao1[i+1]-jiao1[i];
	}
	jiao2[n-1]=360.0-(jiao1[n-1]-jiao1[0]);//将最后一个点与第一个点的夹角求出来 ，储存进去 
	double ans=-1.0;
	for(int i=0;i<n;i++)//找最大相邻两点的夹角 
	{
		ans=max(ans,jiao2[i]);
	}
	ans=360.0-ans;
	printf("%.6lf\n",ans);
	return 0;
}