Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit a9e11f5

Browse files
journal edits
1 parent 4329c24 commit a9e11f5

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

‎README.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -126,13 +126,13 @@ Usually when this happens, I "align" the two solutions so they re-use the same c
126126
after finishing part 2 but the approaches are so algorithmically different that I decided it wasn't worth
127127
the energy.
128128

129-
(time passes)
129+
(later that day)
130130

131131
Well, I've finished a solid pass through all the problems. Here's what I need to return to:
132132

133133
```
134134
Day 14 part 2 = finding the christmas tree
135-
Day 17 part 2 = [quine](https://en.wikipedia.org/wiki/Quine_(computing))-ish problem
135+
Day 17 part 2 = quine-ish problem
136136
Day 21 part 2 = keypad problem
137137
Day 24 part 2 = find 4 swaps of logic gates to make addition work
138138
```
@@ -141,6 +141,6 @@ I think I can do 14 and 21, if I put my mind to it. Honestly, I'm not sure about
141141
For those, I may ask my friend Rob who's also doing AoC this year, or look at reddit, instead of beating my
142142
head against a wall. Which I did for WEEKS for some problems during AoC 2018. Which was not healthy.
143143

144-
(more time passes)
144+
(still later that day)
145145

146146
Hey I figured out day 14!

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /