A - Supercentral Point CodeForces - 165A

One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x₁, y₁), (x₂, y₂), ..., (x_n, y_n). Let's define neighbors for some fixed point from the given set (x, y):

• point (x', y') is (x, y)'s right neighbor, if x' > x and y' = y
• point (x', y') is (x, y)'s left neighbor, if x' < x and y' = y
• point (x', y') is (x, y)'s lower neighbor, if x' = x and y' < y
• point (x', y') is (x, y)'s upper neighbor, if x' = x and y' > y

We'll consider point (x, y) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.

Vasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.

Input

The first input line contains the only integer n (1 ≤ n ≤ 200) — the number of points in the given set. Next n lines contain the coordinates of the points written as "x y" (without the quotes) (|x|, |y| ≤ 1000), all coordinates are integers. The numbers in the line are separated by exactly one space. It is guaranteed that all points are different.

Output

Print the only number — the number of supercentral points of the given set.

 

题解：

判断一个点有没有被东西南北四个点包围 O(n^2)

s

#include<stdio.h>
struct node{
    int x;
    int y;
}points[205];
int main() {
    int n ;
    scanf("%d",&n);
        for(int i = 0; i < n; i++) {
            scanf("%d %d",&points[i].x,&points[i].y);
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            int a = 0;
            int b = 0;
            int c = 0;
            int d = 0;
            for(int  j = 0 ; j < n; j++) {
                if(i == j) continue;
                if(points[j].y == points[i].y && points[i].x < points[j].x) a = 1; //right
                else if(points[j].y == points[i].y && points[i].x > points[j].x) b = 1; //left
                else if(points[j].y > points[i].y && points[i].x == points[j].x) c = 1; //up
                else if(points[j].y < points[i].y && points[i].x == points[j].x) d = 1; //down
                
                if((a + b + c + d )== 4) {
                    ans++;
                    break;
                }
                
            }
        }
        printf("%d\n",ans);
    
    
    return 0;
}