Take input from stdin or argv[1], avoid utils lib

Author: mebeim

2018/solutions/day01.py

@@ -1,9 +1,9 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 
-advent.setup(2018, 1)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 deltas = list(map(int, fin.readlines()))
 done = False
@@ -19,7 +19,7 @@
 
 	seen.add(freq)
 
-advent.print_answer(1, freq)
+print('Part 1:', freq)
 
 while not done:
 	for d in deltas:
@@ -31,4 +31,4 @@
 
 		seen.add(freq)
 
-advent.print_answer(2, freq)
+print('Part 2:', freq)

2018/solutions/day02.py

@@ -1,11 +1,10 @@
 #!/usr/bin/env python3
 
-from utils import advent
-from string import ascii_letters
+import sys
 from collections import Counter
 
-advent.setup(2018, 2)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 ids = list(map(str.rstrip, fin))
 counts = list(map(Counter, ids))
@@ -14,7 +13,7 @@
 three_letters = sum(3 in c.values() for c in counts)
 
 ans = two_letters * three_letters
-advent.print_answer(1, ans)
+print('Part 1:', ans)
 
 
 l = len(ids[0])
@@ -37,4 +36,4 @@
 	if done:
 		break
 
-advent.print_answer(2, s)
+print('Part 2:', s)

2018/solutions/day03.py

@@ -1,10 +1,10 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 from collections import defaultdict
 
-advent.setup(2018, 3)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 canvas = defaultdict(set)
 claim_ids = set()
@@ -24,7 +24,7 @@
 	claim_ids.add(cid)
 
 overlapping = sum(map(lambda x: len(x) > 1, canvas.values()))
-advent.print_answer(1, overlapping)
+print('Part 1:', overlapping)
 
 
 for c in filter(lambda x: len(x) > 1, canvas.values()):
@@ -33,4 +33,4 @@
 assert len(claim_ids) == 1
 
 good = claim_ids.pop()
-advent.print_answer(2, good)
+print('Part 2:', good)

2018/solutions/day04.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 from collections import defaultdict
 
 def get_hour(event):
@@ -16,8 +16,8 @@ def times_slept(guard_id, minute):
 	return sum(a <= minute < b for a, b in guards[guard_id])
 
 
-advent.setup(2018, 4)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 events = list(map(str.split, sorted(fin.readlines())))
 assert 'begins' in events[0]
@@ -38,11 +38,11 @@ def times_slept(guard_id, minute):
 worst_guard_min = max(range(60), key=lambda m: times_slept(worst_guard, m))
 ans = worst_guard * worst_guard_min
 
-advent.print_answer(1, ans)
+print('Part 1:', ans)
 
 
 worst_guard = max(guards, key=lambda g: max(times_slept(g, m) for m in range(60)))
 worst_guard_min = max(range(60), key=lambda m: times_slept(worst_guard, m))
 ans2 = worst_guard * worst_guard_min
 
-advent.print_answer(2, ans2)
+print('Part 2:', ans2)

2018/solutions/day05.py

@@ -1,8 +1,8 @@
 #!/usr/bin/env python3
 
-from utils import advent
-from string import ascii_lowercase, ascii_uppercase
+import sys
 from collections import deque
+from string import ascii_lowercase, ascii_uppercase
 
 def react_fast(p, ignore=set()):
 	l = deque()
@@ -22,14 +22,14 @@ def react_fast(p, ignore=set()):
 	return l
 
 
-advent.setup(2018, 5)
-fin = advent.get_input(mode='rb')
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1], 'rb') if len(sys.argv) > 1 else sys.stdin.buffer
 
 polymer = fin.read().rstrip()
 trimmed = react_fast(polymer)
 reacted_len = len(trimmed)
 
-advent.print_answer(1, reacted_len)
+print('Part 1:', reacted_len)
 
 
 best_reacted_len = reacted_len
@@ -40,4 +40,4 @@ def react_fast(p, ignore=set()):
 	if reacted_len < best_reacted_len:
 		best_reacted_len = reacted_len
 
-advent.print_answer(2, best_reacted_len)
+print('Part 2:', best_reacted_len)

2018/solutions/day07.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 import copy
 import heapq
 from collections import defaultdict
@@ -51,8 +51,8 @@ def work(graph, queue, duration, max_workers):
 	return total_time
 
 
-advent.setup(2018, 7)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 graph = defaultdict(lambda: [0, set()])
 
@@ -68,12 +68,12 @@ def work(graph, queue, duration, max_workers):
 		heapq.heappush(roots, letter)
 
 order = lex_toposort(copy.deepcopy(graph), roots[:])
-advent.print_answer(1, order)
+print('Part 1:', order)
 
 
 durations = {}
 for c in graph:
 	durations[c] = ord(c) - ord('A') + 61
 
 total = work(graph, roots, durations, 5)
-advent.print_answer(2, total)
+print('Part 2:', total)

2018/solutions/day08.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 from collections import namedtuple
 
 Node = namedtuple('Node', ['length', 'children', 'metadata'])
@@ -33,15 +33,15 @@ def node_value(node):
 	return value
 
 
-advent.setup(2018, 8)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 nums = list(map(int, fin.read().split()))
 root = build_tree(nums)
 meta_sum = sum_meta(root)
 
-advent.print_answer(1, meta_sum)
+print('Part 1:', meta_sum)
 
 
 value = node_value(root)
-advent.print_answer(2, value)
+print('Part 2:', value)

2018/solutions/day09.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 from collections import deque
 
 def play(nplayers, max_marble):
@@ -19,14 +19,14 @@ def play(nplayers, max_marble):
 	return max(scores)
 
 
-advent.setup(2018, 9)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 s = fin.read().split()
 nplayers, last_marble = int(s[0]), int(s[6])
 
 winner1 = play(nplayers, last_marble)
-advent.print_answer(1, winner1)
+print('Part 1:', winner1)
 
 winner2 = play(nplayers, last_marble * 100)
-advent.print_answer(2, winner2)
+print('Part 2:', winner2)

2018/solutions/day10.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 import re
 
 def simulate(pts, t):
@@ -33,8 +33,9 @@ def search(pts):
 
 	return t1
 
-advent.setup(2018, 10)
-fin = advent.get_input()
+
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 points = []
 for line in fin:
@@ -52,5 +53,5 @@ def search(pts):
 	word += '\n'
 
 # Can't really print this nicely, but whatever
-advent.print_answer(1, '\n' + word)
-advent.print_answer(2, t)
+print('Part 1:', '\n' + word)
+print('Part 2:', t)

2018/solutions/day12.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 
 def simulate(first_gen, rules, days):
 	cur_gen      = first_gen
@@ -38,8 +38,8 @@ def simulate(first_gen, rules, days):
 	return idx_sum + alive * days_left
 
 
-advent.setup(2018, 12)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 plants = fin.readline().replace('initial state:', '').strip()
 fin.readline()
@@ -53,7 +53,7 @@ def simulate(first_gen, rules, days):
 		rules.add(k)
 
 ans = simulate(plants, rules, 20)
-advent.print_answer(1, ans)
+print('Part 1:', ans)
 
 ans2 = simulate(plants, rules, 50*10**9)
-advent.print_answer(2, ans2)
+print('Part 2:', ans2)

2018/solutions/day16.py

@@ -1,7 +1,8 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 import re
+
 import z3
 
 def solve(ops):
@@ -19,6 +20,10 @@ def solve(ops):
 
 	return tuple(map(z3.IntNumRef.as_long, map(m.eval, variables)))
 
+
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
+
 opcodes = [
 	lambda r,a,b: r[a] + r[b],             #  0 addr
 	lambda r,a,b: r[a] + b,                #  1 addi
@@ -41,10 +46,6 @@ def solve(ops):
 opmap = list(set(range(16)) for i in range(16))
 rexp  = re.compile(r'-?\d+')
 
-
-advent.setup(2018, 16)
-fin = advent.get_input()
-
 data    = fin.read().strip().split('\n\n\n\n')
 samples = [l.split('\n') for l in data[0].split('\n\n')]
 program = [tuple(map(int, l.split())) for l in data[1].split('\n')]
@@ -66,7 +67,7 @@ def solve(ops):
 	if count >= 3:
 		ans += 1
 
-advent.print_answer(1, ans)
+print('Part 1:', ans)
 
 
 opmap = solve(opmap)
@@ -76,4 +77,4 @@ def solve(ops):
 	regs[instr[3]] = opcodes[opmap[instr[0]]](regs, instr[1], instr[2])
 
 ans2 = regs[0]
-advent.print_answer(2, ans2)
+print('Part 2:', ans2)

2018/solutions/day17.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 
-from utils import advent
+import sys
 import re
 
 # This program assumes that a situation like
@@ -87,8 +87,8 @@ def fill(sx, sy):
 
 SAND, WATER, MOVING_WATER, CLAY = range(4)
 
-advent.setup(2018, 17)
-fin = advent.get_input()
+# Open the first argument as input or use stdin if no arguments were given
+fin = open(sys.argv[1]) if len(sys.argv) > 1 else sys.stdin
 
 numexp     = re.compile(r'-?\d+')
 minx, miny = +9999, +9999
@@ -145,7 +145,7 @@ def fill(sx, sy):
 grid = [[SAND] * gridw] + grid
 
 filled = fill(500 - minx + padw, 0) - 1
-advent.print_answer(1, filled)
+print('Part 1:', filled)
 
 
 retained = filled
@@ -161,4 +161,4 @@ def fill(sx, sy):
 			grid[y][x] = MOVING_WATER
 			retained -= 1
 
-advent.print_answer(2, retained)
+print('Part 2:', retained)