python编程

import math

def get_euclidean_distance(point1, point2):
    x1, y1 = point1
    x2, y2 = point2
    return math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)

def make_invisible_coordinates(points):
    invisible_points = []
    for point in points:
        x, y = point
        new_x = x + 10
        new_y = y + 20
        invisible_points.append((new_x, new_y))
    return invisible_points

def find_max_distance_points(points):
    max_distance = 0
    max_point1 = None
    max_point2 = None
    for i in range(len(points)):
        for j in range(i + 1, len(points)):
            distance = get_euclidean_distance(points[i], points[j])
            if distance > max_distance:
                max_distance = distance
                max_point1 = points[i]
                max_point2 = points[j]
    return max_point1, max_point2, max_distance

original_points = [(0, 0), (2, 5), (3, 6), (4, 7), (5, 8)]
invisible_points = make_invisible_coordinates(original_points)
point1, point2, distance = find_max_distance_points(invisible_points)
print(f"隐形坐标中距离最大的两个坐标分别是{point1}和{point2}，最大距离为{distance}")