#dailyprogrammer

Challenge: Print out the lyrics of The Twelve Days of Christmas

Bonus 1: Instead of using 1, 2, 3, 4..., use a, two, three, four...

So to keep my python skills up to speed I’ve recently been trying a few challenges from the dailyprogrammer subreddit. If you need some coding practice then the website is a really useful resource - they’ve got easy, intermediate and expert level challenges designed to be completed in a relatively short period of time.

Here, I just thought I’d post my code to a recent challenge (#213) based on the cellular automata rule #90. You can read the instructions here - it basically produces a nice fractal pattern based on an input of 0 & 1s. Any comments / constructive criticism would be much appreciated.  

Input = 00000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000

txt = open("CA_2.txt").read() #opens the text file iterations = 25 #set number of iterations n = 0 while n <= iterations: #carries on for the specified no. #of iterations output = '' for number in list(txt): if number == '1': output += '*' elif number == '0': output += ' ' print (output) #prints the line converting 0 -> ' ' #and 1 -> 'x' new_txt = '' new_txt += txt[1] #this applies the cellular for number in range(len(txt)-2): #automata XOR rules if txt[number] == txt[(number+2)]: new_txt += '0' elif txt[number] != txt[(number+2)]: new_txt += '1' new_txt += txt[len(txt)-2] txt = new_txt n = n + 1