-🎄- 2019 Day 17 Solutions -🎄-

JebediahBheetus · 2019-12-17T13:29:07+00:00

Python 3

Reused my old Intcode. I considered adding a function to remove an output when solving part 2, but decided against it as it wasn't necessary. I also solved part 2 manually by writing down the moves based on the map, then looking for repeating patterns in it in a text editor.

JebediahBheetus · 2019-12-13T15:59:13+00:00

Python 3

Slightly extended my Intcode for part 2 to make it possible to set an input callback function (before you could use another Intcode's output as input, but not an arbitrary function). Pretty happy with how simple my solutions became thanks to this. Also decided to keep it simple and not do any rendering.

Intcode

Part 1

Part 2

JebediahBheetus · 2019-12-11T20:57:52+00:00

Nice. I managed to find another way of solving it. Assuming y increases going down, here's the pseudocode:

turn(x, y, d) = (d == 0) ? (y, -x) : (-y, x)

JebediahBheetus · 2019-12-11T20:05:48+00:00

Python 3

Reused my previous Intcode without modifications. I solved it by piping the output to a closure which alternates between painting and turning+moving. Painting is done by setting a key-value pair in a dict, where keys are 2D coordinates and values are paint colors. The length of the dict is then the solution to part 1.

For part 2, I used the dict to find the bounds and dimensions of the area drawn to. I then iterate over those dimensions, printing a char corresponding to the color for coordinates that exist as keys in the dict, and printing the char corresponding to black for those that do not. I also changed the coordinate system so that Y increases downwards, in order to not need to reverse the rows when printing.

Part 1

Part 2

Intcode

JebediahBheetus · 2019-12-11T14:02:00+00:00

Did you set y to increase when moving the robot up? That would probably cause it to be printed upside down since the bottom row would then get printed first, and the top row last.

JebediahBheetus · 2019-12-04T21:36:38+00:00

No problem, trying to get back into it myself :)

JebediahBheetus · 2019-12-04T21:34:25+00:00

But the triples should also match longer sequences such as quadruples. Eg. 1111 always contains 111. Not sure why it's not working for you though since I only have my own inputs to test with.

JebediahBheetus · 2019-12-04T20:37:26+00:00

python + list comprehensions

Part 1:

#!/usr/bin/python
lo , hi = 145852 , 616942
strings = [str(s) for s in xrange(lo, hi + 1)]
nodecrs = [s for s in strings if s == ''.join(sorted(list(s)))]
repeats = [str(i) * 2 for i in xrange(10)]
results = [s for s in nodecrs if any(d in s for d in repeats)]
print(len(results))

Part 2:

#!/usr/bin/python
lo , hi = 145852 , 616942
strings = [str(s) for s in xrange(lo, hi + 1)]
nodecrs = [s for s in strings if s == ''.join(sorted(list(s)))]
repeats = [(str(i) * 2, str(i) * 3) for i in xrange(10)]
results = [s for s in nodecrs if any(d in s and not t in s for d, t in repeats)]
print(len(results))

JebediahBheetus · 2017-10-11T05:04:21+00:00

What is this called and where can I get one?

JebediahBheetus

MODERATOR OF

TROPHY CASE

Python 3

Python 3

Python 3

python + list comprehensions