CLOPPAIR  Closest Point Pair
You are given N points on a plane and your task is to find a pair of points with the smallest euclidean distance between them.
All points will be unique and there is only one pair with the smallest distance.
Input
First line of input will contain N (2<=N<=50000) and then N lines follow each line contains two integers giving the X and Y coordinate of the point. Absolute value of X,Y will be atmost 10^6.
Output
Output 3 numbers a b c, where a,b (a<b) are the indexes (0 based) of the point pair in the input and c is the distance between them. Round c to 6 decimal digits.
See samples for more clarification.
Input:
5
0 0
0 1
100 45
2 3
9 9
Output:
0 1 1.000000Input:
5
0 0
4 1
7 2
4 5
1 1
Output:
0 4 1.414214
hide comments
manish1101:
20200613 11:02:06
I have submitted more than 15 times but still stuck at line 179 in my code https://ideone.com/DKZPzF


Saksham :
20200403 21:30:21
'rounding to 6 digits'  this got me. 

Eddy Cael:
20200116 05:09:30
You can use long long or double, it no makes a real difference. 

Eddy Cael:
20200116 05:04:33
Don't waste time in precision issues... Make sure that the algorithm is right and a<b. That's all. 

pyshubh95:
20191110 19:35:02
time waste 

playmaker02:
20190705 11:22:00
acos


playmaker02:
20190705 11:20:41
atan2(y,x)


eng_hardik:
20190511 14:48:33
Getting TLE with n*logn algo in JAVA...Anyone got AC in JAVA ??


ameernsr:
20190210 14:04:48
badihijat


tommydong:
20181215 04:27:01
I got WA on test 12. It was not just a presentation error. I was totally wrong. Perhaps the test before 12 is weak. 
Added by:  SALVO 
Date:  20110414 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Standard Problem 