Commit c0dde877 by BellCodeEditor

save project

parent 4b58d3d5
Showing with 60 additions and 5 deletions
list1 = [] # def fghf(n):
for a in range(0, 1000): # if n==1 or n==2:
for b in range(0, 1000): # return 1
list1.insert(0, 0) # return fghf(n-1)+fghf(n-2)
\ No newline at end of file # print(fghf(5))
# def fghf1(n):
# if n==1 or n==2:
# return 1
# else:
# jfv=[1,1]
# for i in range(n-2):
# o=jfv=[-1]+jfv=[-2]
# jfv.append(o)
# return jfv[-1]
# print(fghf1(8))
import turtle as l
l.hideturtle()
lejh=300
l.tracer(False)
def koth(lejh,n):
if n==0:
l.forward(lejh)
return''
koth(lejh/3,n-1)
l.left(60)
koth(lejh/3,n-1)
l.right(120)
koth(lejh/3,n-1)
l.left(60)
koth(lejh/3,n-1)
l.up()
l.goto(-200,200)
l.down()
for i in range(3):
koth(lejh,8)
l.right(120)
l.done()
# for a in range(0, 1000):
# for b in range(0, 1000):
# list1.insert(0, 0)
\ No newline at end of file
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