1)
from turtle import*
up()
goto(30, 20)
down()
goto(30, 60)
goto(80, 60)
goto(80, 30)
goto(150, 30)
goto(150, 50)
goto(160, 30)
goto(170, 20)
goto(30, 20)
up()
goto(40, 30)
down()
goto(40, 30)
goto(70, 50)
goto(70, 30)
goto(40, 30)
2)
from turtle import*
shape("triangle")
forward(200)
stamp()
write("x")
home()
left(90)
forward(180)
stamp()
write("y")
home()
right(90)
forward(40)
home()
left(180)
forward(50)
home()
up()
goto(10, 10)
down()
for i in range(3):
forward(80 - i*20)
left(90)
forward(80 - i*20)
left(90)
forward(80 - i*20)
left(90)
forward(80 - i*20)
left(90)
up()
goto(20 + i*10, 20 + i*10)
down()
Объяснение:
function gcd(a,b:integer):integer;
// Нахождение НОД
var
i: longint;
begin
while b <> 0 do begin
a := a mod b;
i := b; b := a; a := i
end;
Result:=a
end;
begin
var a:=ReadInteger('a=');
var b:=ReadInteger('b=');
var nod:=gcd(a,b);
if nod>1 then
WritelnFormat('Дробь сократима: {0}/{1}={2}/{3}',
a,b,a div nod,b div nod)
else WritelnFormat('Дробь {0}/{1} несократима',a,b)
end.
Тестовое решение:
a= 23541
b= 335160
Дробь сократима: 23541/335160=59/840