CF598C.Nearest vectors

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 00 and ππ . For example, opposite directions vectors have angle equals to ππ .

输入格式

First line of the input contains a single integer nn ( 2<=n<=1000002<=n<=100000 ) — the number of vectors.

The ii -th of the following nn lines contains two integers xix_{i} and yiy_{i} ( |x|,|y|<=10000,x^{2}+y^{2}>0 ) — the coordinates of the ii -th vector. Vectors are numbered from 11 to nn 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).

输出格式

Print two integer numbers aa and bb ( aba≠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.

输入输出样例

  • 输入#1

    4
    -1 0
    0 -1
    1 0
    1 1
    

    输出#1

    3 4
    
  • 输入#2

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

    输出#2

    6 5
首页