write a program in C++,C,Pascal as follows
You are given N points with non-negative integer x
and y-coordinates. Your task is to count the number of right-angled triangles that can be formed
using these points as vertices such that one side of
the triangle is parallel to the x-axis and another
side is parallel to the y-axis.
For example, using the nine points on the right,
we can form three such right-angled triangles.

Question

write a program in C++,C,Pascal as follows 
You are given N points with non-negative integer x
and y-coordinates. Your task is to count the number of right-angled triangles that can be formed
using these points as vertices such that one side of
the triangle is parallel to the x-axis and another
side is parallel to the y-axis.
For example, using the nine points on the right,
we can form three such right-angled triangles.

anonymous · Answer

Input format
The ﬁrst line of input is an integer N, denoting the number of points. This is followed by
N lines of input, each containing two integers, separated by a space, specifying the x and y
coordinate of one point. You may assume that each coordinate x and y lies in the range 0 to 10^5

.