abeaumont / competitive-programming Goto Github PK

T = int(input())

lattice = []
for _ in range(T):
    x, y = map(int, input().split())
    lattice.append((x, y))

count = 0
for index in range(len(lattice)):
    cur_x = lattice[index][0] 
    cur_y = lattice[index][1]
    for jndex in range(index, len(lattice)):
        
        nex_x = lattice[jndex][0]
        nex_y = lattice[jndex][1]
        
        if ((cur_x + 2018 == nex_x and cur_y == nex_y) or
        (cur_x - 2018 == nex_x and cur_y == nex_y) or
        (cur_x == nex_x and cur_y + 2018 == nex_y) or
        (cur_x == nex_x and cur_y - 2018 == nex_y) or
        # more
        (cur_x + 1118 == nex_x and cur_y + 1680 == nex_y) or
        (cur_x + 1118 == nex_x and cur_y - 1680 == nex_y) or
        (cur_x - 1118 == nex_x and cur_y + 1680 == nex_y) or
        (cur_x - 1118 == nex_x and cur_y - 1680 == nex_y) or
        # more
        (cur_x + 1680 == nex_x and cur_y + 1118 == nex_y) or
        (cur_x + 1680 == nex_x and cur_y - 1118 == nex_y) or
        (cur_x - 1680 == nex_x and cur_y + 1118 == nex_y) or
        (cur_x - 1680 == nex_x and cur_y - 1118 == nex_y)):
            count += 1
print(count)