In a given cartesian plane, there are N points. We need to find the Number of Pairs of points(A,B) such that
Note : Pair of 2 points(A,B) is considered same as Pair of 2 points(B ,A).
Manhattan Distance = |x2-x1|+|y2-y1|
Euclidean Distance = ((x2-x1)^2 + (y2-y1)^2)^0.5 where points are (x1,y1) and (x2,y2).
First Line Consist of T - number of test cases.
For each Test case:-
First Line consist of N , Number of points
Next line contains N pairs contains two integers Xi and Yi i.e, X coordinate and the Y coordinate of a Point
Print the number of pairs as asked above.
1<=T <= 50
1<=N <= 2*10 ^ 5
0<=(|Xi|, |Yi| ) <= 10^9
Sample Input :
1 2 1 1 7 5
Sample Output :
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.