$\Large %n$

$\Large %n$

$\Large %n$

演示

哪只海龟所走的路程更短？

复位

制作教程：

A = (1.8224545909989267, 0.7455116046192155)
C = Point(xAxis)
B = Intersect(xAxis, yAxis)
t1, c, a, b = Polygon(A, B, C)
α = Angle(B, A, C)
γ = Angle(A, C, B)
β = Angle(C, B, A)
F = (2.085104165962301, -0.00793175407207053)
G = (2.5083080308435006, -0.00793175407207053)
海龟1 = Turtle()
海龟2 = Turtle()
D = (3.064664522095273, -1.024912393289155)
E = (3.783404057135104, -1.024912393289155)
H = (3.0737199968583564, -0.163437275928902)
I = (3.792459531898187, -0.163437275928902)

Tool: 坐标系
x最小、最大，y最小、最大，0.23
Input: m, n, q, p, a
Output: A, B, O, l1, l2, list3, list4, list5, list6, u, v

$\huge\textcolor{}{x}$

$\huge\textcolor{}{y}$

$\Large{O}$

u = Vector((m - 1, 0), (n + 1, 0))
l1 = Sequence(Segment[(k, 0), (k, a)], k, m, n)
A: (n + 1, 0)
list4 = Sequence(Text[k, Element[Sequence[(t - 0.15, 0), t, 1, n], k], true, true], k, 1, n)
list3 = Sequence(Text[k, Element[Sequence[(t - 0.5, 0), t, m, -1], k + abs(m) + 1], true, true], k, m, -1)
l2 = Sequence(Segment[(0, k), (a, k)], k, q, p)
list5 = Sequence(Text[k, Element[Sequence[(-0.9, t + 0.2), t, q, -1], k + abs(q) + 1], true, true], k, q, -1)
v = Vector((0, q - 1), (0, p + 1))
B: (0, p + 1)
list6 = Sequence(Text[k, Element[Sequence[(-0.6, t + 0.2), t, 1, p], k], true, true], k, 1, p)
O: B - (0, p + 1)