zoukankan      html  css  js  c++  java
  • 玫瑰花

    import turtle
    turtle.setup(0.5,0.75,0,0)
    turtle.begin_fill()
    turtle.fillcolor("red")
    for i in range(100):
        turtle.fd(0.1)
        turtle.left(1)
    turtle.left(50)
    for i in range(100):
        turtle.fd(0.5)
        turtle.left(1)
    turtle.left(90)
    for i in range(50):
        turtle.fd(1.5)
        turtle.left(1.5)
    turtle.left(90)
    for i in range(70):
        turtle.fd(1.5)
        turtle.left(1.5)
    turtle.seth(-90)
    turtle.fd(30)
    turtle.seth(120)
    turtle.fd(10)
    turtle.seth(260)
    for i in range(100):
        turtle.fd(1.2)
        turtle.left(1)
    turtle.left(30)
    for i in range(50):
        turtle.fd(3)
        turtle.left(2)
    turtle.end_fill()
    turtle.seth(260)
    turtle.fd(30)
    turtle.seth(250)
    turtle.circle(100,30)
    turtle.seth(250)
    turtle.circle(100,30)
    turtle.seth(-68)
    turtle.pendown()
    turtle.circle(200,90)
    turtle.penup()
    turtle.seth(170)
    turtle.fd(210)
    turtle.seth(45)
    turtle.speed(40)
    turtle.pendown()
    turtle.fd(20)
    turtle.begin_fill()
    turtle.seth(15)
    turtle.circle(90,90)
    turtle.seth(-165)
    turtle.circle(90,90)
    turtle.color("green")
    turtle.end_fill()
    turtle.penup()
    turtle.seth(180)
    turtle.fd(30)
    turtle.pendown()
    turtle.fd(20)
    turtle.begin_fill()
    turtle.seth(165)
    turtle.circle(90,90)
    turtle.seth(-15)
    turtle.circle(90,90)
    turtle.color("green")
    turtle.end_fill()
    turtle.seth(180)
    turtle.circle(40,60)
    turtle.done()
    

     

    终于完成了  整的难。。。

    还看了看别人的

  • 相关阅读:
    LeetCode Ugly Number
    LeetCode Missing Number
    拓扑排序
    不相交集的求并算法(按集合大小求并+按高度求并)
    数据结构排序总结
    基数排序
    java 发展简史
    java 白皮书的关键术语
    包+类导入+静态导入+类放入包中+包作用域
    关于二叉堆(优先队列)的其他操作及其应用
  • 原文地址:https://www.cnblogs.com/intbjw/p/7748183.html
Copyright © 2011-2022 走看看