Include my answers in the problem

2019/day01/problem

@@ -2,71 +2,70 @@ Advent of Code
 
 --- Day 1: The Tyranny of the Rocket Equation ---
 
-   Santa has become stranded at the edge of the Solar System while delivering presents
+   Santa has become stranded at the edge of the Solar System while delivering presents to other planets! To
-   to other planets! To accurately calculate his position in space, safely align his
+   accurately calculate his position in space, safely align his warp drive, and return to Earth in time to save
-   warp drive, and return to Earth in time to save Christmas, he needs you to bring
+   Christmas, he needs you to bring him measurements from fifty stars.
-   him measurements from fifty stars.
 
-   Collect stars by solving puzzles. Two puzzles will be made available on each day in
+   Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the
-   the Advent calendar; the second puzzle is unlocked when you complete the first.
+   second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
-   Each puzzle grants one star. Good luck!
 
    The Elves quickly load you into a spacecraft and prepare to launch.
 
-   At the first Go / No Go poll, every Elf is Go until the Fuel Counter-Upper. They
+   At the first Go / No Go poll, every Elf is Go until the Fuel Counter-Upper. They haven't determined the amount of
-   haven't determined the amount of fuel required yet.
+   fuel required yet.
 
-   Fuel required to launch a given module is based on its mass. Specifically, to find
+   Fuel required to launch a given module is based on its mass. Specifically, to find the fuel required for a module,
-   the fuel required for a module, take its mass, divide by three, round down, and
+   take its mass, divide by three, round down, and subtract 2.
-   subtract 2.
 
    For example:
 
-     * For a mass of 12, divide by 3 and round down to get 4, then subtract 2 to get
+     • For a mass of 12, divide by 3 and round down to get 4, then subtract 2 to get 2.
-       2.
+     • For a mass of 14, dividing by 3 and rounding down still yields 4, so the fuel required is also 2.
-     * For a mass of 14, dividing by 3 and rounding down still yields 4, so the fuel
+     • For a mass of 1969, the fuel required is 654.
-       required is also 2.
+     • For a mass of 100756, the fuel required is 33583.
-     * For a mass of 1969, the fuel required is 654.
-     * For a mass of 100756, the fuel required is 33583.
 
-   The Fuel Counter-Upper needs to know the total fuel requirement. To find it,
+   The Fuel Counter-Upper needs to know the total fuel requirement. To find it, individually calculate the fuel
-   individually calculate the fuel needed for the mass of each module (your puzzle
+   needed for the mass of each module (your puzzle input), then add together all the fuel values.
-   input), then add together all the fuel values.
 
    What is the sum of the fuel requirements for all of the modules on your spacecraft?
 
-   The first half of this puzzle is complete! It provides one gold star: *
+   Your puzzle answer was 3299598.
 
 --- Part Two ---
 
-   During the second Go / No Go poll, the Elf in charge of the Rocket Equation
+   During the second Go / No Go poll, the Elf in charge of the Rocket Equation Double-Checker stops the launch
-   Double-Checker stops the launch sequence. Apparently, you forgot to include
+   sequence. Apparently, you forgot to include additional fuel for the fuel you just added.
-   additional fuel for the fuel you just added.
 
-   Fuel itself requires fuel just like a module - take its mass, divide by three,
+   Fuel itself requires fuel just like a module - take its mass, divide by three, round down, and subtract 2.
-   round down, and subtract 2. However, that fuel also requires fuel, and that fuel
+   However, that fuel also requires fuel, and that fuel requires fuel, and so on. Any mass that would require
-   requires fuel, and so on. Any mass that would require negative fuel should instead
+   negative fuel should instead be treated as if it requires zero fuel; the remaining mass, if any, is instead
-   be treated as if it requires zero fuel; the remaining mass, if any, is instead
+   handled by wishing really hard, which has no mass and is outside the scope of this calculation.
-   handled by wishing really hard, which has no mass and is outside the scope of this
-   calculation.
 
-   So, for each module mass, calculate its fuel and add it to the total. Then, treat
+   So, for each module mass, calculate its fuel and add it to the total. Then, treat the fuel amount you just
-   the fuel amount you just calculated as the input mass and repeat the process,
+   calculated as the input mass and repeat the process, continuing until a fuel requirement is zero or negative. For
-   continuing until a fuel requirement is zero or negative. For example:
+   example:
 
-     * A module of mass 14 requires 2 fuel. This fuel requires no further fuel (2
+     • A module of mass 14 requires 2 fuel. This fuel requires no further fuel (2 divided by 3 and rounded down is 0,
-       divided by 3 and rounded down is 0, which would call for a negative fuel), so
+       which would call for a negative fuel), so the total fuel required is still just 2.
-       the total fuel required is still just 2.
+     • At first, a module of mass 1969 requires 654 fuel. Then, this fuel requires 216 more fuel (654 / 3 - 2). 216
-     * At first, a module of mass 1969 requires 654 fuel. Then, this fuel requires 216
+       then requires 70 more fuel, which requires 21 fuel, which requires 5 fuel, which requires no further fuel. So,
-       more fuel (654 / 3 - 2). 216 then requires 70 more fuel, which requires 21
+       the total fuel required for a module of mass 1969 is 654 + 216 + 70 + 21 + 5 = 966.
-       fuel, which requires 5 fuel, which requires no further fuel. So, the total fuel
+     • The fuel required by a module of mass 100756 and its fuel is: 33583 + 11192 + 3728 + 1240 + 411 + 135 + 43 +
-       required for a module of mass 1969 is 654 + 216 + 70 + 21 + 5 = 966.
+       12 + 2 = 50346.
-     * The fuel required by a module of mass 100756 and its fuel is: 33583 + 11192 +
-       3728 + 1240 + 411 + 135 + 43 + 12 + 2 = 50346.
 
-   What is the sum of the fuel requirements for all of the modules on your spacecraft
+   What is the sum of the fuel requirements for all of the modules on your spacecraft when also taking into account
-   when also taking into account the mass of the added fuel? (Calculate the fuel
+   the mass of the added fuel? (Calculate the fuel requirements for each module separately, then add them all up at
-   requirements for each module separately, then add them all up at the end.)
+   the end.)
+
+   Your puzzle answer was 4946546.
+
+   Both parts of this puzzle are complete! They provide two gold stars: **
+
+   At this point, you should return to your Advent calendar and try another puzzle.
+
+   If you still want to see it, you can get your puzzle input.
+
+   You can also [Shareon Twitter Mastodon] this puzzle.
 
 References
 
@@ -85,4 +84,5 @@ References
    . https://adventofcode.com/2019/leaderboard
    . https://adventofcode.com/2019/stats
    . https://adventofcode.com/2019/sponsors
+   . https://adventofcode.com/2019
    . https://adventofcode.com/2019/day/1/input

2019/day02/problem

@@ -0,0 +1,145 @@
+Advent of Code
+
+--- Day 2: 1202 Program Alarm ---
+
+   On the way to your gravity assist around the Moon, your ship computer beeps angrily about a "1202 program alarm".
+   On the radio, an Elf is already explaining how to handle the situation: "Don't worry, that's perfectly norma--"
+   The ship computer bursts into flames.
+
+   You notify the Elves that the computer's magic smoke seems to have escaped. "That computer ran Intcode programs
+   like the gravity assist program it was working on; surely there are enough spare parts up there to build a new
+   Intcode computer!"
+
+   An Intcode program is a list of integers separated by commas (like 1,0,0,3,99). To run one, start by looking at
+   the first integer (called position 0). Here, you will find an opcode - either 1, 2, or 99. The opcode indicates
+   what to do; for example, 99 means that the program is finished and should immediately halt. Encountering an
+   unknown opcode means something went wrong.
+
+   Opcode 1 adds together numbers read from two positions and stores the result in a third position. The three
+   integers immediately after the opcode tell you these three positions - the first two indicate the positions from
+   which you should read the input values, and the third indicates the position at which the output should be stored.
+
+   For example, if your Intcode computer encounters 1,10,20,30, it should read the values at positions 10 and 20, add
+   those values, and then overwrite the value at position 30 with their sum.
+
+   Opcode 2 works exactly like opcode 1, except it multiplies the two inputs instead of adding them. Again, the three
+   integers after the opcode indicate where the inputs and outputs are, not their values.
+
+   Once you're done processing an opcode, move to the next one by stepping forward 4 positions.
+
+   For example, suppose you have the following program:
+
+ 1,9,10,3,2,3,11,0,99,30,40,50
+
+   For the purposes of illustration, here is the same program split into multiple lines:
+
+ 1,9,10,3,
+ 2,3,11,0,
+ 99,
+ 30,40,50
+
+   The first four integers, 1,9,10,3, are at positions 0, 1, 2, and 3. Together, they represent the first opcode (1,
+   addition), the positions of the two inputs (9 and 10), and the position of the output (3). To handle this opcode,
+   you first need to get the values at the input positions: position 9 contains 30, and position 10 contains 40. Add
+   these numbers together to get 70. Then, store this value at the output position; here, the output position (3) is
+   at position 3, so it overwrites itself. Afterward, the program looks like this:
+
+ 1,9,10,70,
+ 2,3,11,0,
+ 99,
+ 30,40,50
+
+   Step forward 4 positions to reach the next opcode, 2. This opcode works just like the previous, but it multiplies
+   instead of adding. The inputs are at positions 3 and 11; these positions contain 70 and 50 respectively.
+   Multiplying these produces 3500; this is stored at position 0:
+
+ 3500,9,10,70,
+ 2,3,11,0,
+ 99,
+ 30,40,50
+
+   Stepping forward 4 more positions arrives at opcode 99, halting the program.
+
+   Here are the initial and final states of a few more small programs:
+
+     • 1,0,0,0,99 becomes 2,0,0,0,99 (1 + 1 = 2).
+     • 2,3,0,3,99 becomes 2,3,0,6,99 (3 * 2 = 6).
+     • 2,4,4,5,99,0 becomes 2,4,4,5,99,9801 (99 * 99 = 9801).
+     • 1,1,1,4,99,5,6,0,99 becomes 30,1,1,4,2,5,6,0,99.
+
+   Once you have a working computer, the first step is to restore the gravity assist program (your puzzle input) to
+   the "1202 program alarm" state it had just before the last computer caught fire. To do this, before running the
+   program, replace position 1 with the value 12 and replace position 2 with the value 2. What value is left at
+   position 0 after the program halts?
+
+   Your puzzle answer was 4930687.
+
+--- Part Two ---
+
+   "Good, the new computer seems to be working correctly! Keep it nearby during this mission - you'll probably use it
+   again. Real Intcode computers support many more features than your new one, but we'll let you know what they are
+   as you need them."
+
+   "However, your current priority should be to complete your gravity assist around the Moon. For this mission to
+   succeed, we should settle on some terminology for the parts you've already built."
+
+   Intcode programs are given as a list of integers; these values are used as the initial state for the computer's
+   memory. When you run an Intcode program, make sure to start by initializing memory to the program's values. A
+   position in memory is called an address (for example, the first value in memory is at "address 0").
+
+   Opcodes (like 1, 2, or 99) mark the beginning of an instruction. The values used immediately after an opcode, if
+   any, are called the instruction's parameters. For example, in the instruction 1,2,3,4, 1 is the opcode; 2, 3, and
+   4 are the parameters. The instruction 99 contains only an opcode and has no parameters.
+
+   The address of the current instruction is called the instruction pointer; it starts at 0. After an instruction
+   finishes, the instruction pointer increases by the number of values in the instruction; until you add more
+   instructions to the computer, this is always 4 (1 opcode + 3 parameters) for the add and multiply instructions.
+   (The halt instruction would increase the instruction pointer by 1, but it halts the program instead.)
+
+   "With terminology out of the way, we're ready to proceed. To complete the gravity assist, you need to determine
+   what pair of inputs produces the output 19690720."
+
+   The inputs should still be provided to the program by replacing the values at addresses 1 and 2, just like before.
+   In this program, the value placed in address 1 is called the noun, and the value placed in address 2 is called the
+   verb. Each of the two input values will be between 0 and 99, inclusive.
+
+   Once the program has halted, its output is available at address 0, also just like before. Each time you try a pair
+   of inputs, make sure you first reset the computer's memory to the values in the program (your puzzle input) - in
+   other words, don't reuse memory from a previous attempt.
+
+   Find the input noun and verb that cause the program to produce the output 19690720. What is 100 * noun + verb?
+   (For example, if noun=12 and verb=2, the answer would be 1202.)
+
+   Your puzzle answer was 5335.
+
+   Both parts of this puzzle are complete! They provide two gold stars: **
+
+   At this point, you should return to your Advent calendar and try another puzzle.
+
+   If you still want to see it, you can get your puzzle input.
+
+   You can also [Shareon Twitter Mastodon] this puzzle.
+
+References
+
+   Visible links
+   . https://adventofcode.com/
+   . https://adventofcode.com/2019/about
+   . https://adventofcode.com/2019/events
+   . https://adventofcode.com/2019/settings
+   . https://adventofcode.com/2019/auth/logout
+   . Advent of Code Supporter
+	https://adventofcode.com/2019/support
+   . https://adventofcode.com/2019
+   . https://adventofcode.com/2019
+   . https://adventofcode.com/2019/support
+   . https://adventofcode.com/2019/sponsors
+   . https://adventofcode.com/2019/leaderboard
+   . https://adventofcode.com/2019/stats
+   . https://adventofcode.com/2019/sponsors
+   . https://en.wikipedia.org/wiki/Gravity_assist
+   . https://en.wikipedia.org/wiki/Halt_and_Catch_Fire
+   . https://en.wikipedia.org/wiki/Magic_smoke
+   . https://en.wikipedia.org/wiki/Integer
+   . https://adventofcode.com/2019
+   . https://adventofcode.com/2019/day/2/input

2019/day03/problem

@@ -2,17 +2,20 @@ Advent of Code
 
 --- Day 3: Crossed Wires ---
 
-   The gravity assist was successful, and you're well on your way to the Venus refuelling station. During the rush back on Earth, the fuel management
+   The gravity assist was successful, and you're well on your way to the Venus refuelling station. During the rush
-   system wasn't completely installed, so that's next on the priority list.
+   back on Earth, the fuel management system wasn't completely installed, so that's next on the priority list.
 
-   Opening the front panel reveals a jumble of wires. Specifically, two wires are connected to a central port and extend outward on a grid. You trace the
+   Opening the front panel reveals a jumble of wires. Specifically, two wires are connected to a central port and
-   path each wire takes as it leaves the central port, one wire per line of text (your puzzle input).
+   extend outward on a grid. You trace the path each wire takes as it leaves the central port, one wire per line of
+   text (your puzzle input).
 
-   The wires twist and turn, but the two wires occasionally cross paths. To fix the circuit, you need to find the intersection point closest to the central
+   The wires twist and turn, but the two wires occasionally cross paths. To fix the circuit, you need to find the
-   port. Because the wires are on a grid, use the Manhattan distance for this measurement. While the wires do technically cross right at the central port
+   intersection point closest to the central port. Because the wires are on a grid, use the Manhattan distance for
-   where they both start, this point does not count, nor does a wire count as crossing with itself.
+   this measurement. While the wires do technically cross right at the central port where they both start, this point
+   does not count, nor does a wire count as crossing with itself.
 
-   For example, if the first wire's path is R8,U5,L5,D3, then starting from the central port (o), it goes right 8, up 5, left 5, and finally down 3:
+   For example, if the first wire's path is R8,U5,L5,D3, then starting from the central port (o), it goes right 8, up
+   5, left 5, and finally down 3:
 
  ...........
  ...........
@@ -38,7 +41,8 @@ Advent of Code
  .o-------+.
  ...........
 
-   These wires cross at two locations (marked X), but the lower-left one is closer to the central port: its distance is 3 + 3 = 6.
+   These wires cross at two locations (marked X), but the lower-left one is closer to the central port: its distance
+   is 3 + 3 = 6.
 
    Here are a few more examples:
 
@@ -49,16 +53,19 @@ Advent of Code
 
    What is the Manhattan distance from the central port to the closest intersection?
 
+   Your puzzle answer was 258.
+
 --- Part Two ---
 
    It turns out that this circuit is very timing-sensitive; you actually need to minimize the signal delay.
 
-   To do this, calculate the number of steps each wire takes to reach each intersection; choose the intersection where the sum of both wires' steps is
+   To do this, calculate the number of steps each wire takes to reach each intersection; choose the intersection
-   lowest. If a wire visits a position on the grid multiple times, use the steps value from the first time it visits that position when calculating the
+   where the sum of both wires' steps is lowest. If a wire visits a position on the grid multiple times, use the
-   total value of a specific intersection.
+   steps value from the first time it visits that position when calculating the total value of a specific
+   intersection.
 
-   The number of steps a wire takes is the total number of grid squares the wire has entered to get to that location, including the intersection being
+   The number of steps a wire takes is the total number of grid squares the wire has entered to get to that location,
-   considered. Again consider the example from above:
+   including the intersection being considered. Again consider the example from above:
 
  ...........
  .+-----+...
@@ -71,11 +78,11 @@ Advent of Code
  .o-------+.
  ...........
 
-   In the above example, the intersection closest to the central port is reached after 8+5+5+2 = 20 steps by the first wire and 7+6+4+3 = 20 steps by the
+   In the above example, the intersection closest to the central port is reached after 8+5+5+2 = 20 steps by the
-   second wire for a total of 20+20 = 40 steps.
+   first wire and 7+6+4+3 = 20 steps by the second wire for a total of 20+20 = 40 steps.
 
-   However, the top-right intersection is better: the first wire takes only 8+5+2 = 15 and the second wire takes only 7+6+2 = 15, a total of 15+15 = 30
+   However, the top-right intersection is better: the first wire takes only 8+5+2 = 15 and the second wire takes only
-   steps.
+   7+6+2 = 15, a total of 15+15 = 30 steps.
 
    Here are the best steps for the extra examples from above:
 
@@ -86,6 +93,8 @@ Advent of Code
 
    What is the fewest combined steps the wires must take to reach an intersection?
 
+   Your puzzle answer was 12304.
+
    Both parts of this puzzle are complete! They provide two gold stars: **
 
    At this point, you should return to your Advent calendar and try another puzzle.
@@ -109,6 +118,7 @@ References
    . https://adventofcode.com/2019/leaderboard
    . https://adventofcode.com/2019/stats
    . https://adventofcode.com/2019/sponsors
+   . https://tretton37.com/join
    . https://en.wikipedia.org/wiki/Taxicab_geometry
    . https://adventofcode.com/2019
    . https://adventofcode.com/2019/day/3/input