summary refs log tree commit diff homepage
Commit message (Collapse)AuthorAge
* Solve day 16 part 1 in CJune McEnroe2020-12-16
|
* Solve day 16 part 1June McEnroe2020-12-16
| | | | Oh god I barely know what I'm doing in perl.
* Update day 14 part 2 with the clever wayJune McEnroe2020-12-15
|
* Solve day 15 part 2June McEnroe2020-12-15
|
* Solve day 15 part 1June McEnroe2020-12-15
|
* Rewrite day 14 to log all writes then sort themJune McEnroe2020-12-14
| | | | Down from 1.56s to 0.04s.
* "Allocate" only 4 MB rather than 1 TB for day 14 part 2June McEnroe2020-12-14
| | | | | There are <512 writes in the input data, and at most 9 bits floating. Doesn't really matter much, though.
* Solve day 14 part 2June McEnroe2020-12-14
| | | | Quite messy but it works.
* Solve day 14 part 1June McEnroe2020-12-14
|
* Spoiled solve day 13 part 2June McEnroe2020-12-13
| | | | | | I think I might've been close to coming up with this at some point but everyone was acting like it was impossible without knowing "Chinese Remainder Theorem" and I just got pissed off.
* Solve day 13 part 1June McEnroe2020-12-13
|
* Solve day 12 part 2June McEnroe2020-12-12
| | | | | In classic fashion, I typo'd an x as a y and failed to catch it until reading over the code for the 5th time.
* Solve day 12 part 1June McEnroe2020-12-12
|
* Solve day 11 part 2June McEnroe2020-12-11
|
* Solve day 11 part 1June McEnroe2020-12-11
|
* Solve day 10 part 2June McEnroe2020-12-10
| | | | | Much tougher than part 1. I got tripped up on using an int where I needed a long again. That number is huge!
* Solve day 10 part 1June McEnroe2020-12-10
| | | | Trivial??
* Solve day 9 part 2June McEnroe2020-12-09
|
* Solve day 9 part 1June McEnroe2020-12-09
|
* Solve day 8 part 2June McEnroe2020-12-08
|
* Solve day 8 part 1June McEnroe2020-12-08
|
* Check cons[i].cnt to break out of loopJune McEnroe2020-12-07
| | | | That was bothering me.
* Solve day 7 part 2June McEnroe2020-12-07
|
* Solve day 7 part 1June McEnroe2020-12-07
|
* Solve day 6 part 2June McEnroe2020-12-06
|
* Solve day 6 part 1June McEnroe2020-12-06
|
* Solve day 5 part 2June McEnroe2020-12-05
|
* Solve day 5 part 1June McEnroe2020-12-05
|
* Solve day 4 part 2June McEnroe2020-12-04
|
* Solve day 4 part 1June McEnroe2020-12-04
| | | | | | The read builtin returning 1 for EOF when the last line doesn't end with a newline tripped me up. Only a problem because I like to just copy the input and use pbpaste, I guess.
* Solve day 3 part 2June McEnroe2020-12-03
|
* Solve day 3 part 1June McEnroe2020-12-03
|
* Solve day 2 part 2June McEnroe2020-12-02
|
* Solve day 2 part 1June McEnroe2020-12-02
|
* Solve day 1 part 2June McEnroe2020-12-01
| | | | 41.66 real 39.15 user 1.98 sys
* Solve day 1 part 1June McEnroe2020-12-01
|
* Solve day 10 part 2June McEnroe2020-11-22
| | | | | | | | I'm so fucking frustrated with this one. I was stuck for hours trying to sort the points by angle not realizing that (int)(angle(a) - angle(b)) would be 0 for all angles with differences smaller than 1. I also wanted to do the sort by atan2(-y, x) - π/2 intuitively to get "up" be zero, but I never got that to work.
* Solve day 10 part 1June McEnroe2020-11-22
|
* Solve day 8 part 2June McEnroe2020-11-22
|
* Solve day 8 part 1June McEnroe2020-11-22
|
* Solve day 7 part 2June McEnroe2020-11-22
| | | | | Yikes, I had gotten annoyed at this on day 7 because I didn't see what was wrong. Turns out I was just missing amp[0].in = 0.
* Solve day 7 part 1June McEnroe2020-11-22
|
* Solve day 6 part 2June McEnroe2020-11-22
|
* Solve day 6 part 1June McEnroe2020-11-22
|
* Solve day 5 part 2June McEnroe2020-11-22
|
* Solve day 5 part 1June McEnroe2020-11-22
|
* Add alternate shell solution for day 4June McEnroe2020-11-22
|
* Solve day 4 part 2June McEnroe2020-11-22
|
* Solve day 4 part 1June McEnroe2020-11-22
|
* Solve day 3 part 2June McEnroe2020-11-22
| | | | | | | Dang, I got screwed up by normalizing the lines in place rather than just for the intersection function. When it came to calculating the length of the final segment to the intersection, the "last" point was sometimes the wrong end.