63 lines
927 B
Python
63 lines
927 B
Python
import turtle
|
|
|
|
t = turtle.Turtle()
|
|
t.left(90)
|
|
|
|
# def hexagon(n):
|
|
# for i in range(n):
|
|
# turtle.right(120)
|
|
# turtle.forward(200)
|
|
# hexagon(6)
|
|
|
|
def stair(n):
|
|
if n <= 0:
|
|
return
|
|
turtle.forward(20)
|
|
turtle.left(90)
|
|
turtle.forward(20)
|
|
turtle.right(90)
|
|
|
|
stair(n - 1)
|
|
|
|
turtle.speed(10)
|
|
stair(100)
|
|
turtle.done()
|
|
|
|
t.left(90)
|
|
def baum(length, n):
|
|
if n <= 0:
|
|
return
|
|
|
|
t.forward(length)
|
|
t.right(45)
|
|
t.forward(length // 1.1)
|
|
t.right(180)
|
|
t.forward(length // 1.1)
|
|
t.right(90)
|
|
t.forward(length // 1.1)
|
|
|
|
return n * baum(n - 1)
|
|
|
|
|
|
|
|
# baum(50, 10)
|
|
# turtle.done()
|
|
|
|
# def baum(n):
|
|
# if n < 0:
|
|
# return
|
|
|
|
# t.forward(n / 2)
|
|
# t.left(30)
|
|
# baum(n - 1)
|
|
# t.right(60)
|
|
# baum(n - 1)
|
|
# t.left(30)
|
|
# t.backward(n / 2)
|
|
|
|
# turtle.tracer(False)
|
|
# # turtle.speed(0)
|
|
|
|
# baum(15)
|
|
# turtle.update()
|
|
# turtle.done() |