A small Christmas' Tree Algorithm in Python.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import turtle | |
screen = turtle.Screen() | |
screen.setup(800,600) | |
circle = turtle.Turtle() | |
circle.shape('circle') | |
circle.color('red') | |
circle.speed('fastest') | |
circle.up() | |
square = turtle.Turtle() | |
square.shape('square') | |
square.color('green') | |
square.speed('fastest') | |
square.up() | |
circle.goto(0,280) | |
circle.stamp() | |
k = 0 | |
for i in range(1, 17): | |
y = 30*i | |
for j in range(i-k): | |
x = 30*j | |
square.goto(x,-y+280) | |
square.stamp() | |
square.goto(-x,-y+280) | |
square.stamp() | |
if i % 4 == 0: | |
x = 30*(j+1) | |
circle.color('red') | |
circle.goto(-x,-y+280) | |
circle.stamp() | |
circle.goto(x,-y+280) | |
circle.stamp() | |
k += 2 | |
if i % 4 == 3: | |
x = 30*(j+1) | |
circle.color('yellow') | |
circle.goto(-x,-y+280) | |
circle.stamp() | |
circle.goto(x,-y+280) | |
circle.stamp() | |
square.color('brown') | |
for i in range(17,20): | |
y = 30*i | |
for j in range(3): | |
x = 30*j | |
square.goto(x,-y+280) | |
square.stamp() | |
square.goto(-x,-y+280) | |
square.stamp() | |
turtle.exitonclick() |
No offence christmastree.py, but mine is much better
If you're gonna gloat about your code being better than someone else's, at least have the decency to make it work.
t.goto(each)
^
IndentationError: expected an indented block
thanks
Gracias
Gracias muy divertido él curso y él código , uff! aprendiendo. :-)
muchas gracias, muy entusiasmado con el tema.
All I got were 5 yellow circles.
Gracias, desde Republica Dominicana.
for mac, install
brew install python@3.9
brew install python-tk
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
It is working, however you have to ident the code in the right way!