CodeForces - 598C Nearest vectors

C. Nearest vectors

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given the set of vectors on the plane, each of them starting at the origin. Your task is to find a pair of vectors with the minimal non-oriented angle between them.

Non-oriented angle is non-negative value, minimal between clockwise and counterclockwise direction angles. Non-oriented angle is always between 0 and π. For example, opposite directions vectors have angle equals to π.

Input

First line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the number of vectors.

The i-th of the following n lines contains two integers xi and yi (|x|, |y| ≤ 10 000, x2 + y2 > 0) — the coordinates of the i-th vector. Vectors are numbered from 1 to n in order of appearing in the input. It is guaranteed that no two vectors in the input share the same direction (but they still can have opposite directions).

Output

Print two integer numbers a and b (a ≠ b) — a pair of indices of vectors with the minimal non-oriented angle. You can print the numbers in any order. If there are many possible answers, print any.

Examples

input

Copy

4
-1 0
0 -1
1 0
1 1

output

3 4

input

Copy

6
-1 0
0 -1
1 0
1 1
-4 -5
-4 -6

output

6 5

题意：

给定二维坐标系上的点，把这些点和原点连线，问连线中哪两个所夹角最小

思路：

坑..用long double

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <vector>
#define max_ 100010
#define inf 0x3f3f3f3f
#define ll long long
#define les 1e-8
using namespace std;
#define double long double
int n;
struct Node
{
    double w;
    int k;
};
struct Node num[max_];
bool cmp(const Node &a,const Node &b)
{
    return a.w<b.w;
}
int main(int argc, char const *argv[]) {
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        num[i].k=i;
        double x,y;
        scanf("%llf%llf",&x,&y);
        if(x==0)
        {
            if(y>0)
            num[i].w=pi*0.5;
            else
            num[i].w=pi*1.5;
            continue;
        }
        if(y==0)
        {
            if(x>0)
            num[i].w=0;
            else
            num[i].w=pi;
            continue;
        }
        if(x>0&&y>0)
        num[i].w=atan(y/x);
        if(x<0&&y>0)
        num[i].w=pi-atan(y*-1.0/x);
        if(x<0&&y<0)
        num[i].w=pi+atan(y/x);
        if(x>0&&y<0)
        num[i].w=2*pi-atan(y*-1.0/x);
    }
    sort(num+1,num+1+n,cmp);
    double minn=num[1].w+(2*pi-num[n].w);
    int ans=1;
    for(int i=2;i<=n;i++)
    {
        double d=num[i].w-num[i-1].w;
        if(d<minn)
        {
            minn=d;
            ans=i;
        }
    }
    if(ans==1)
    printf("%d %d\n",num[1].k,num[n].k);
    else
    printf("%d %d\n",num[ans].k,num[ans-1].k);
    return 0;
}