Program treug;
Uses crt;
Var
x1, y1, x2, y2, x3, y3, d1, d2, d3, max: word;
Begin
Clrscr;
Writeln('Введите координаты вершин: ');
Write('x1: ');
Readln(x1);
Write('y1: ');
Readln(y1);
Write('x2: ');
Readln(x2);
Write('y2: ');
Readln(y2);
Write('x3: ');
Readln(x3);
Write('y3: ');
Readln(y3);
d1 := sqrt(sqr(x2 - x1) + sqr(y2 - y1));
d2 := sqrt(sqr(x3 - x2) + sqr(y3 - y2));
d3 := sqrt(sqr(x3 - x1) + sqr(y3 - y1));
If (d1 > d2) and (d1 > d3) then
max := d1
else if d2 > d3 then
max := d2
else
max := d3;
Writeln('Наибольшая сторона треугольника = ', max);
End.