• 个人简介

    Python 很好 画树代码(PYthon)#已完成

    from turtle import *   #hetao1136081
    from random import * #hetao1136081
    from math import * #hetao1136081
    def tree(n, l):
        pd()
        t = cos(radians(heading() + 45)) / 8 + 0.25
        pencolor(t, t, t)
        pensize(n / 3)
        forward(l)
        if n > 0:
            b = random() * 15 + 10 
            c = random() * 15 + 10
            d = l * (random() * 0.25 + 0.7)
            right(b)
            tree(n - 1, d)
            left(b + c)
            tree(n - 1, d)
            right(c)
        else:
            right(90)
            n = cos(radians(heading() - 45)) / 4 + 0.5
            pencolor(n, n*0.8, n*0.8)
            circle(3)
            left(90)
            if(random() > 0.7):
                pu()
                t = heading()
                an = -40 + random()*40
                setheading(an)
                dis = int(800*random()*0.5 + 400*random()*0.3 + 200*random()*0.2)
                forward(dis)
                setheading(t)
                pd()
                right(90)
                n = cos(radians(heading() - 45)) / 4 + 0.5
                pencolor(n*0.5+0.5, 0.4+n*0.4, 0.4+n*0.4)
                circle(2)
                left(90)
                pu()
                t = heading()
                setheading(an)
                backward(dis)
                setheading(t)
        pu()
        backward(l)
    bgcolor(0.5, 0.5, 0.5)
    ht()
    #速度,1-10渐进,0最快
    speed(0)
    #删除下面一行即可一步步显示画的步骤,不删直接出图(要等10秒左右)
    tracer(0, 0)
    pu()
    backward(100)
    left(90)
    pu()
    backward(300) #hetao1136081
    tree(12, 100) #hetao1136081
    done() #hetao1136081
    

    C++也不错

    新手400(常规)

    csp-j ≥300(一般情况)

    csp-s ≥100(一般情况)

    GESP四级6月认证(2024) 已通过

  • 通过的题目

  • 最近活动

    This person is lazy and didn't join any contests or homework.
  • 最近编写的题解

    This person is lazy and didn't write any solutions.

题目标签

客观题
1