Advent of Code Solutions
I have set myself a personal challenge to try and get up to date with advent of code, a set of programming challenges released each December. Each day has 2 related problems, for a total of 50 problems per year. Each button below will show my code solving that problem. Green buttons where I have solved both problems of the day, orange where I have only solved the first one and red where I haven't solved either. Not started
Part 1 completed
Both parts completed
from util.input import get_input
def part_1():
puzzle_input = get_input(2016, 3)
n_possible = 0
for row in puzzle_input.splitlines():
s1, s2, s3 = list(map(int,row.split()))
if any([
s1 +s2 <= s3,
s1 + s3 <= s2,
s2 + s3 <= s1
]):
continue
n_possible += 1
return n_possible
def part_2():
puzzle_input = get_input(2016, 3)
n_possible = 0
s1s = []
s2s = []
s3s = []
for i, row in enumerate(puzzle_input.splitlines()):
s1, s2, s3 = list(map(int,row.split()))
s1s.append(s1)
s2s.append(s2)
s3s.append(s3)
if (i+1) % 3 == 0:
for x in [s1s, s2s, s3s]:
s1, s2, s3 = x
if any([
s1 +s2 <= s3,
s1 + s3 <= s2,
s2 + s3 <= s1
]):
continue
n_possible += 1
s1s = []
s2s = []
s3s = []
return n_possible