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
sHaShAnK sHeKhAr:
20150622 07:41:25
Use long long int :) 

Rishab Banerjee:
20150524 17:23:43
12th test case WA no idea why :( I have used linesweep algorithm Last edit: 20150524 17:24:32 

Kamil Debowski:
20150316 16:54:01
guys, be careful about "Round c to 6 decimal digits." 

S Akira Sai Karthik:
20150206 06:41:21
Getting wrong answer after test case 12 any idea ??? 

Chuyên Nhật CNN:
20140823 18:00:52
I think the test cases are week : 

Erdem Kirez:
20140731 13:48:14
Be careful about output.


bat2009fifa:
20140206 13:08:40
you can never trust double or even long double more than long long int.


innovolt:
20131109 18:56:51
any spcl test case...getting WA after 12th test case 

Ashutosh Singla:
20130825 18:34:14
take care of limits Last edit: 20130826 21:22:42 

i_hate_myself:
20130222 19:15:11
getting wrng ans on 12th test case...give me some more test case.. ???

Added by:  SALVO 
Date:  20110414 
Time limit:  0.169s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Standard Problem 