číslo kroku

A_{1} = (13.26, 2.24)
B_{1} = (4.46, 1.08)
f = Line(A_{1}, B_{1})
C_{1} = (10.26, -4.46)
g = Line(C_{1}, f)
D = (8.662302473726706, -0.9046049474534117)
E = (10.382302473726707, 0.3153950525465883)
c = Circle(D, E)
A = Point(f)
h = OrthogonalLine(A, f)
B = Intersect(g, h)
i = LineBisector(A, B)
C = Intersect(h, i)
d = Circle(D, Radius[c] + Distance[A, C])
s_1 = Intersect(d, i, 1)
k_1 = Circle(s_1, Distance[A, C])
s_2 = Intersect(d, i, 2)
k_2 = Circle(s_2, Distance[A, C])
p = Circle(D, Distance[A, C] - Radius[c])
s_3 = Intersect(p, i, 1)
k_3 = Circle(s_3, Distance[A, C])
s_4 = Intersect(p, i, 2)
k_4 = Circle(s_4, Distance[A, C])
číslo = 0 (slider from 0 to 7, step 1)