约瑟夫环问题实现（python+turtle动画演示）

import turtle
turtle.setup(800, 800)
turtle.pencolor('white')
turtle.goto(0, -200)
turtle.pencolor('black')
turtle.width(2)
turtle.speed(4)
for i in range(8):
    turtle.circle(200, 45)
    turtle.dot(100, 'orange')
    turtle.pencolor('black')
    turtle.write(str(i), font=('宋体', 40, 'bold'))
    turtle.pencolor('black')

count = -1
i = -1
num = 0
mylist = [0, 0, 0, 0, 0, 0, 0, 0]
n = 8
m = 3
while (num < n-1):
    count = 0
    while(count < m):
        i = (i+1) % n
        turtle.pencolor('red')
        turtle.circle(200, 45)
        if(mylist[i] != 1):
            count = count+1
    mylist[i] = 1
    turtle.dot(100, 'red')
    turtle.pencolor('black')
    turtle.write(str(i), font=('宋体', 40, 'bold'))
    num = num + 1
turtle.mainloop()