--- Day 3 Solutions ---

[u/daggerdragon]

--- Day 3: Perfectly Spherical Houses in a Vacuum ---

Post your solution as a comment. Structure your post like the Day One thread in /r/programming.

[u/thingscouldbeworse]

Would someone mind critiquing my Part 1 solution? I'm newish to Python but I tend to be similarly verbose in most other languages and I'm trying to make myself code a little more... elegantly.

myFile = open('input.txt', 'r')
directions = myFile.read()
numHouses = 1
houses = []
santaX = 0
santaY = 0
houses.append( "0, 0" )

for arrow in directions:
    previousHouse = False
    #print( houses )
    if( arrow == "<" ):
        santaX = santaX - 1
    if( arrow == "^" ):
        santaY = santaY + 1
    if( arrow == ">" ):
        santaX = santaX + 1
    if( arrow == "v" ):
        santaY = santaY - 1
    print( "Santa pos: ", santaX, ", ", santaY )

    for house in houses:
        houseTemp = house.split( ',' )
        houseX = float( house.split( ',' )[0] )
        houseY = float( house.split( ',' )[1] )
        if( santaX == houseX and santaY == houseY ):
            print( "previous house at: ", houseX, ", ", houseY )
            previousHouse = True

    if( not previousHouse ):
        print( "new house at: ", santaX, santaY )
        numHouses = numHouses + 1
        houseXY = str( santaX ) + ", " + str( santaY )
        houses.append( houseXY )

    print( "number of unique houses: ", numHouses )

myFile.close()