Commit 98ba25f0 by BellCodeEditor

save project

parent e552cd61
Showing with 10 additions and 29 deletions
import turtle num_list = [1,3,5,8,11,15,17,18,20,21]
import random mid = (low+high)//2
def tree(n): guess = num_list[mid]
if n >= 50: if guess == num:
pen.forward(n) print("找到了")
a = random.randint(0,30) elif guess < num:
l = random.randint(1,15) low = mid + 1
pen.right(a) else:
tree(n-l) high = mid - 1
pen.left(2*a) \ No newline at end of file
tree(n-l)
pen.right(a)
pen.up()
pen.backward(n)
pen.down()
pen = turtle.Turtle()
pen.color('sienna')
# 画布大小
w = turtle.Screen()
w.bgcolor('wheat') # wheat小麦
# 移动到起点
pen.left(90)
pen.up()
pen.backward(150) # 后退
pen.down()
tree(100)
turtle.done()
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment