added days 1-5 of advent of code 2021

Author: n4t3m

advent_of_code_2021/day1.py

@@ -0,0 +1,27 @@
+## Task 1
+
+nums = []
+
+with open('day1input') as f:
+    for line in f:
+        nums.append(int(line))
+
+greater_than_prev = 0
+
+for i in range(1, len(nums)):
+    if nums[i]>nums[i-1]:
+        greater_than_prev+=1
+
+print('===Part 1===')
+print(greater_than_prev)
+
+## Task 2
+
+greater_than_prev = 0
+
+for i in range(2, len(nums)-1):
+    if nums[i]+nums[i-1]+nums[i+1]>nums[i-1]+nums[i]+nums[i-2]:
+        greater_than_prev+=1
+
+print('===Part 2===')
+print(greater_than_prev)

advent_of_code_2021/day2.py

@@ -0,0 +1,33 @@
+horizontal = 0
+depth = 0
+
+with open('day2input') as f:
+    for line in f:
+        parse = line.split()
+        if parse[0]=="forward":
+            horizontal+=int(parse[1])
+        elif parse[0]=="up":
+            depth-=int(parse[1])
+        else:
+            depth+=int(parse[1])
+
+print('===Part 1===')
+print(depth*horizontal)
+         
+horizontal = 0
+depth = 0
+aim = 0
+
+with open('day2input') as f:
+    for line in f:
+        parse = line.split()
+        if parse[0]=="forward":
+            horizontal+=int(parse[1])
+            depth += aim * int(parse[1])
+        elif parse[0]=="up":
+            aim-=int(parse[1])
+        else:
+            aim+=int(parse[1])
+
+print('===Part 1===')
+print(depth*horizontal)

advent_of_code_2021/day3.py

@@ -0,0 +1,66 @@
+input = []
+
+with open('day3input') as f:
+    for line in f:
+        input.append(line.strip())
+
+gamma = ""
+epsilon = ""
+
+#most common goes in gamma
+
+zero_count = [0]*len(input[0])
+
+for s in input:
+    for i, x in enumerate(s):
+        if x=="0":
+            zero_count[i]+=1
+
+for i in range(len(zero_count)):
+    if zero_count[i]>len(input)/2:
+        gamma+="1"
+        epsilon+="0"
+    else:
+        gamma+="0"
+        epsilon+="1"
+
+print('===Part 1===')
+print(int(gamma, 2)*int(epsilon, 2))
+
+#Part 2 Start!
+
+iteration = 0
+oxygen_vals = input
+while len(oxygen_vals)!=1:
+    one_count = 0
+    #find most common bit
+    for val in oxygen_vals:
+        if val[iteration]=="1":
+            one_count+=1
+    if one_count>= len(oxygen_vals) /2:
+        #keep numbers where val[iteration]=1
+        oxygen_vals = list(filter(lambda x: x[iteration] == "1", oxygen_vals))
+    else:
+        oxygen_vals = list(filter(lambda x: x[iteration] == "0", oxygen_vals))
+    iteration+=1
+oxygen_val = oxygen_vals[0]
+
+iteration = 0
+co_vals = input
+while len(co_vals)!=1:
+    one_count = 0
+    #find most common bit
+    for val in co_vals:
+        if val[iteration]=="1":
+            one_count+=1
+    if one_count < len(co_vals) /2:
+        #keep numbers where val[iteration]=1
+        co_vals = list(filter(lambda x: x[iteration] == "1", co_vals))
+    else:
+        co_vals = list(filter(lambda x: x[iteration] == "0", co_vals))
+    iteration+=1
+
+co_val = co_vals[0]
+
+print('===Part 2===')
+print( int(oxygen_val, 2)*int(co_val, 2) )

advent_of_code_2021/day4_part1.py

@@ -0,0 +1,54 @@
+draws = []
+boards = []
+current_draws = []
+
+def checkBoard(b):
+    #check rows
+    for r in b:
+        row_set = set(r)
+        draw_set = set(current_draws)
+        if len(row_set.intersection(draw_set))==5:
+            return r
+
+    #check columns
+    #generate array of column
+    for c in range(5):
+        col = []
+        for i in range(5):
+            col.append(b[i][c])    
+        col_set = set(col)
+        draw_set = set(current_draws)                       
+        if len(col_set.intersection(draw_set))==5:
+            return col        
+    return []
+
+def sumOfUnmarked(b):
+    sum = 0
+    for r in b:
+        for num in r:
+            if num not in current_draws:
+                sum+=num
+    return sum
+
+def partOne():
+    with open('day4input') as f:
+        lines = f.readlines()
+        draw_input = lines[0].split(',')
+        draws = [int(x.strip()) for x in draw_input]
+        for i in range(2, len(lines), 6):
+            b = []
+            for j in range(i, i+5):
+                b.append( [int(s.strip()) for s in lines[j].split()]  )
+            boards.append(b)
+    for draw in draws:
+        current_draws.append(draw)
+        for b in boards:
+            a = checkBoard(b)
+            if a!=[]:
+                return sumOfUnmarked(b)*draw
+
+def main():
+    print('===Part One===')
+    print(partOne())
+                
+main()

advent_of_code_2021/day4_part2.py

@@ -0,0 +1,58 @@
+draws = []
+boards = []
+current_draws = []
+seen = []
+
+def checkBoard(b):
+    #check rows
+    for r in b:
+        row_set = set(r)
+        draw_set = set(current_draws)
+        if len(row_set.intersection(draw_set))==5:
+            return r
+
+    #check columns
+    #generate array of column
+    for c in range(5):
+        col = []
+        for i in range(5):
+            col.append(b[i][c])    
+        col_set = set(col)
+        draw_set = set(current_draws)                       
+        if len(col_set.intersection(draw_set))==5:
+            return col        
+    return []
+
+def sumOfUnmarked(b):
+    sum = 0
+    for r in b:
+        for num in r:
+            if num not in current_draws:
+                sum+=num
+    return sum
+
+def partTwo():
+    with open('day4input') as f:
+        lines = f.readlines()
+        draw_input = lines[0].split(',')
+        draws = [int(x.strip()) for x in draw_input]
+        for i in range(2, len(lines), 6):
+            b = []
+            for j in range(i, i+5):
+                b.append( [int(s.strip()) for s in lines[j].split()]  )
+            boards.append(b)
+    for draw in draws:
+        current_draws.append(draw)
+        for b in boards:
+            a = checkBoard(b)
+            if a!=[]:
+                if b not in seen:
+                    last = sumOfUnmarked(b)*draw
+                    seen.append(b)
+    return last
+
+def main():
+    print('===Part Two===')
+    print(partTwo())
+                
+main()

advent_of_code_2021/day5_part1.py

@@ -0,0 +1,41 @@
+input = []
+maxX = 0
+maxY = 0
+
+with open('day5input') as f:
+    for line in f:
+        p = line.strip().split(' -> ')
+        x1 = int(p[0].split(',')[0])
+        y1 = int(p[0].split(',')[1])
+        x2 = int(p[1].split(',')[0])
+        y2 = int(p[1].split(',')[1])
+
+        if x1==x2 or y1==y2:
+            input.append( ((x1, y1), (x2, y2))  )
+            maxX = max(maxX, x1, x2)
+            maxY = max(maxY, y1, y2)
+
+grid = []
+for x in range(maxY+1):
+    grid.append( [0]*(maxX+1))
+
+
+for op in input:
+    x1 = op[0][0]
+    y1 = op[0][1]
+    x2 = op[1][0]
+    y2 = op[1][1]
+    if x1==x2:
+        for i in range(min(y1, y2), max(y1, y2)+1):
+            grid[i][x1]+=1
+    else:
+        for i in range( min(x1, x2), max(x1, x2)+1):
+            grid[y1][i]+=1
+count = 0
+
+for row in grid:
+    for elem in row:
+        if elem>=2:
+            count+=1
+
+print(count)

advent_of_code_2021/day5_part2.py

@@ -0,0 +1,46 @@
+input = []
+maxX = 0
+maxY = 0
+
+with open('day5input') as f:
+    for line in f:
+        p = line.strip().split(' -> ')
+        x1 = int(p[0].split(',')[0])
+        y1 = int(p[0].split(',')[1])
+        x2 = int(p[1].split(',')[0])
+        y2 = int(p[1].split(',')[1])
+
+        input.append( ((x1, y1), (x2, y2)) )
+        maxX = max(maxX, x1, x2)
+        maxY = max(maxY, y1, y2)
+
+grid = []
+for x in range(maxY+1):
+    grid.append( [0]*(maxX+1))
+
+
+for op in input:
+    x1 = op[0][0]
+    y1 = op[0][1]
+    x2 = op[1][0]
+    y2 = op[1][1]
+    if x1==x2:
+        for i in range(min(y1, y2), max(y1, y2)+1):
+            grid[i][x1]+=1
+    elif y1==y2:
+        for i in range( min(x1, x2), max(x1, x2)+1):
+            grid[y1][i]+=1
+    elif x1 < x2 and y1 < y2 or x2<x1 and y2<y1:
+        for i in range(0, max(x1, x2) - min(x1, x2)+1):
+            grid[min(y2, y1)+i][min(x2, x1)+i]+=1
+    else:
+        for i in range(0,  max(x1, x2) - min(x1, x2)+1):
+            grid[max(y1, y2)-i][min(x1, x2)+i]+=1
+
+
+count = 0
+for row in grid:
+    for elem in row:
+        if elem>=2:
+            count+=1
+print(count)