Advent_of_Code VS Advent-of-Code

This made me think about how to make my own Python solution more elegant. It was one of the earlier things I wrote in Python, and I've done almost every AoC year since! I've refactored it and switched to using complex numbers, I think it turned out pretty well. Here's the code for both parts.

Here's my own solution, if you're interested: https://github.com/Nomen-Heroum/Advent_of_Code/blob/master/2020/day20.py

On a vaguely related note, I decided to finally commit my solutions to GitHub! Here is my day 20 solution, cleaned up and commented to death for your reading convenience.

Mine went down from 20062 to 16881 recursive calls, here's my code (also Python 3). Just add a global CALLS before line 7 and global CALLS; CALLS += 1 before line 17 in the if block to count the function calls.

git repo

Very ugly, very hardcoded, very dirty, and a really quick C# solution. Will clean up it in the next couple of days.

C# solution, this day is the day when my code for the first part returns the correct value for the second part! Secret is that I didn't read that I need numbers of dots after the first fold and I did print results out of curiosity. But it works!

Solution using Stack in C#

Some really ugly C# solution

not my proudest C# solution

C# repo. Happy AoC everyone!

C# repo

C# (C Sharp)

Github repo, this is done, three more days to go...