43 lines
971 B
Python
43 lines
971 B
Python
import re
|
|
from collections import deque, Counter, defaultdict
|
|
from heapq import heappop, heappush
|
|
from itertools import compress, combinations, chain, permutations
|
|
|
|
from output import matrix, D, DD, ADJ, ints, mhd, mdbg, vdbg, cw, ccw, bk
|
|
|
|
|
|
def solve(data):
|
|
p1 = None
|
|
p2 = None
|
|
return p1, p2
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import os
|
|
|
|
# use dummy data
|
|
inp = """
|
|
A Y
|
|
B X
|
|
C Z
|
|
""".strip()
|
|
|
|
# uncomment to instead use stdin
|
|
# import sys; inp = sys.stdin.read().strip()
|
|
|
|
# uncomment to use AoC provided puzzle input
|
|
# with open("./input/02.txt", "r") as f:
|
|
# inp = f.read().strip()
|
|
|
|
# uncomment to do initial data processing shared by part 1-2
|
|
p1, p2 = solve(inp)
|
|
|
|
print(p1)
|
|
os.system(f"echo {p1} | wl-copy")
|
|
# print(p2)
|
|
# os.system(f"echo {p2} | wl-copy")
|
|
|
|
# uncomment and replace 0 with actual output to refactor code
|
|
# and ensure nonbreaking changes
|
|
# assert p1 == 0
|
|
# assert p2 == 0
|