From e9208ade043f2304225d1e1150f57fa31aa49c28 Mon Sep 17 00:00:00 2001 From: Andrew Guschin Date: Sun, 4 Apr 2021 21:39:38 +0400 Subject: =?UTF-8?q?=D0=94=D0=BE=D0=B1=D0=B0=D0=B2=D0=B8=D0=BB=208,=2010,?= =?UTF-8?q?=2011=20=D0=B7=D0=B0=D0=B4=D0=B0=D1=87=D0=B8=20=D0=BF=D0=BE=20?= =?UTF-8?q?=D0=BF=D0=B8=D1=82=D0=BE=D0=BD=D1=83?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- python-func/task10.py | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 python-func/task10.py (limited to 'python-func/task10.py') diff --git a/python-func/task10.py b/python-func/task10.py new file mode 100644 index 0000000..8c548e1 --- /dev/null +++ b/python-func/task10.py @@ -0,0 +1,40 @@ +from math import sqrt + + +class Point: + def __init__(self, x: float, y: float): + self.x = x + self.y = y + + +def dist(p1: Point, p2: Point) -> float: + return sqrt((p2.x - p1.x) ** 2 + (p2.y - p1.y) ** 2) + + +def solve(points: list[Point]) -> int: + cnt = 0 + for p1 in points: + for p2 in points: + for p3 in points: + if p1 == p2 or p2 == p3 or p3 == p1: + continue + + a = dist(p1, p2) + b = dist(p2, p3) + c = dist(p3, p1) + + if a + b > c and a + c > b and b + c > a: + cnt += 1 + return cnt + + +n = int(input("Введите количество точек: ")) +points = [] +for i in range(n): + x, y = map(float, input().split()) + p = Point(x, y) + points.append(p) + +res = solve(points) +print(f"Используя введённые точки можно создать {res} треугольников") + -- cgit v1.2.3