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
darshit05:
20171004 13:05:27
For test case 12 use std::fixed; before using std::setprecision(6); 

miaortizma:
20170820 03:46:02
12th case solved by checking my minimum (default) distance. 

bruceoutdoors:
20170819 18:01:53
also this problem was never pass with python. The time limit set is too little! 

bruceoutdoors:
20170819 17:52:06
I used double instead of long long int and still passed (?_?) 

bruceoutdoors:
20170819 17:29:35
omg guys. I managed to get past test case 12. So what happened was that my solution was correct, but because I used cout with setprecision(7), it displayed the wrong answer for some reason. So if you want to pass this challenge, use printf


AAKASH TYAGI:
20161230 21:10:00
Remember to print the smaller index first 

abhishekrahul:
20161217 15:54:49
can anyone provide me fully accepted code for this question ,, i am trying it from two days but always getting wa near test case 12 ....


anshal dwivedi:
20160323 09:39:42
Use long long int: ) , using double caused me 4 WA on test case 12 ;( 

kr1996:
20160119 21:48:24
12th case WA is probably because of the (a<b) condition 

Sudharsansai:
20160107 15:07:09
Don't use long long...May get WA becoz of that.Use double.Comparisons are not that strict !! Attention to (a<b) in output .( WA becoz of that _) .

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 