Solved Day 4 of AOC2019

akulumbeg · akulumbeg · commit ef1cb8a4da6e · 2019-12-07T15:16:52.000+01:00
diff --git a/2019/Day4.R b/2019/Day4.R
@@ -5,24 +5,74 @@ rm(list = ls())
 input <- readLines("2019/data/Day4.txt")
 input <- as.integer(unlist(strsplit(input,"-")))
 
-password <- function(min = input[1], max = input[2]) {
+passwords <- function(min = input[1], max = input[2]) {
   
   require(stringi)
   require(dplyr)
   vector <- as.character(min:max)
-  dbl_digits <- stringi::stri_count_regex(vector, pattern = "(\\d)\\1+")
-  vector <- vector[which(dbl_digits == 1)]
   
-  vector <- strsplit(vector, "")
-  vector <- lapply(vector, as.integer)
-   
-  return(vector)
+  vh <- tibble(d1 = as.integer(substring(vector, 1, 1)),
+                         d2 = as.integer(substring(vector, 2, 2)),
+                         d3 = as.integer(substring(vector, 3, 3)),
+                         d4 = as.integer(substring(vector, 4, 4)),
+                         d5 = as.integer(substring(vector, 5, 5)),
+                         d6 = as.integer(substring(vector, 6, 6))
+                                         )
+  
+  vh <- vh %>% 
+    filter(d6 >= d5 & d5 >= d4 & d4 >= d3 & d3 >= d2 & d2 >= d1) %>%
+    filter(d1 == d2 | d2 == d3 | d3 == d4 | d4 == d5 | d5 == d6)
+  
+  return(vh)
           
    
 }
 
-password()
+nrow(passwords())
 
+# Explanation
+# The first two conditions (range and 6 digits) are fulfilled by default, so we only check for the other two.
+# The function splits the number in string format and puts every digit in integer form into a separate column.
+# From there, we filter using two criteria: The number in the column to the right can be equal or larger,
+# and numbers in any two adjacent columns must be equal.
 
 
 # Part 2 ------------------------------------------------------------------
+# Process the input in form of XXXXXX-YYYYYY
+rm(list = ls())
+input <- readLines("2019/data/Day4.txt")
+input <- as.integer(unlist(strsplit(input,"-")))
+
+passwords <- function(min = input[1], max = input[2]) {
+  
+  require(stringi)
+  require(dplyr)
+  vector <- as.character(min:max)
+  
+  vh <- tibble(d1 = as.integer(substring(vector, 1, 1)),
+               d2 = as.integer(substring(vector, 2, 2)),
+               d3 = as.integer(substring(vector, 3, 3)),
+               d4 = as.integer(substring(vector, 4, 4)),
+               d5 = as.integer(substring(vector, 5, 5)),
+               d6 = as.integer(substring(vector, 6, 6))
+  )
+  
+  vh <- vh %>% 
+    filter(d6 >= d5 & d5 >= d4 & d4 >= d3 & d3 >= d2 & d2 >= d1) %>%
+    filter((d1 == d2 & d2 != d3)| 
+             (d2 == d3 & (d2 != d1 & d3 != d4)) | 
+             (d3 == d4 & (d3 != d2 & d4 != d5)) | 
+             (d4 == d5 & (d4 != d3 & d5 != d6)) |
+             (d5 == d6 & d5 != d4))
+  
+  return(vh)
+  
+  
+}
+
+nrow(passwords())
+
+# Explanation
+# The same principle with slight modification, in the second filtering condition, we assure that
+# adjacent numbers are the same, but also exclude the cases when adjacent numbers to our compared pair
+# are the same as any one of the numbers in the compared pair.
diff --git a/2019/Day5.R b/2019/Day5.R
@@ -0,0 +1,8 @@
+# Part 1 ------------------------------------------------------------------
+rm(list = ls())
+
+
+
+
+
+# Part 2 ------------------------------------------------------------------
diff --git a/2019/Day7.R b/2019/Day7.R
@@ -1,5 +1,5 @@
 # Part 1 ------------------------------------------------------------------
-
+rm(list = ls())
 
 
 
diff --git a/2019/README.md b/2019/README.md
@@ -1,12 +1,12 @@
 # Advent of Code 2019  
 
-[x] Day 1  | [Solution](2019/Day1.R) | [Data](2019/data/Day1.txt) | [Assignment](2019/assignments/Day1.md)  
-[x] Day 2  | [Solution](2019/Day2.R) | [Data](2019/data/Day2.txt) | [Assignment](2019/assignments/Day2.md)  
-[x] Day 3  | [Solution](2019/Day3.R) | [Data](2019/data/Day3.txt) | [Assignment](2019/assignments/Day3.md) *thanks to [u/turtlegraphics](https://www.reddit.com/user/turtlegraphics/)*    
-[ ] Day 4  | [Solution](2019/Day4.R) | [Data](2019/data/Day4.txt) | [Assignment](2019/assignments/Day4.md)  
-[ ] Day 5  | [Solution](2019/Day5.R) | [Data](2019/data/Day5.txt) | [Assignment](2019/assignments/Day5.md)  
-[x] Day 6  | [Solution](2019/Day6.R) | [Data](2019/data/Day6.txt) | [Assignment](2019/assignments/Day6.md)  
-[ ] Day 7  | [Solution](2019/Day7.R) | [Data](2019/data/Day7.txt) | [Assignment](2019/assignments/Day7.md)  
+[x] Day 1  | [Solution](Day1.R) | [Data](data/Day1.txt) | [Assignment](assignments/Day1.md)  
+[x] Day 2  | [Solution](Day2.R) | [Data](data/Day2.txt) | [Assignment](assignments/Day2.md)  
+[x] Day 3  | [Solution](Day3.R) | [Data](data/Day3.txt) | [Assignment](assignments/Day3.md) *thanks to [u/turtlegraphics](https://www.reddit.com/user/turtlegraphics/)*    
+[ ] Day 4  | [Solution](Day4.R) | [Data](data/Day4.txt) | [Assignment](assignments/Day4.md)  
+[ ] Day 5  | [Solution](Day5.R) | [Data](data/Day5.txt) | [Assignment](assignments/Day5.md)  
+[x] Day 6  | [Solution](Day6.R) | [Data](data/Day6.txt) | [Assignment](assignments/Day6.md)  
+[ ] Day 7  | [Solution](Day7.R) | [Data](data/Day7.txt) | [Assignment](assignments/Day7.md)  
 [ ] Day 8  
 [ ] Day 9  
 [ ] Day 10  
diff --git a/2019/assignments/Day4.md b/2019/assignments/Day4.md
@@ -16,4 +16,15 @@ Other than the range rule, the following are true:
 * 223450 does not meet these criteria (decreasing pair of digits 50).  
 * 123789 does not meet these criteria (no double).  
 
-*How many different passwords within the range given in your puzzle input meet these criteria?*
+*How many different passwords within the range given in your puzzle input meet these criteria?*
+
+**--- Part Two ---**
+An Elf just remembered one more important detail: the two adjacent matching digits are not part of a larger group of matching digits.  
+
+Given this additional criterion, but still ignoring the range rule, the following are now true:  
+
+* 112233 meets these criteria because the digits never decrease and all repeated digits are exactly two digits long.  
+* 123444 no longer meets the criteria (the repeated 44 is part of a larger group of 444).  
+* 111122 meets the criteria (even though 1 is repeated more than twice, it still contains a double 22).  
+
+How many different passwords within the range given in your puzzle input meet all of the criteria?  
diff --git a/2019/assignments/Day5.md b/2019/assignments/Day5.md
@@ -0,0 +1,52 @@
+**--- Day 5: Sunny with a Chance of Asteroids ---**
+
+You're starting to sweat as the ship makes its way toward Mercury. The Elves suggest that you get the air conditioner working by upgrading your ship computer to support the Thermal Environment Supervision Terminal.  
+
+The Thermal Environment Supervision Terminal (TEST) starts by running a diagnostic program (your puzzle input). The TEST diagnostic program will run on your existing Intcode computer after a few modifications:  
+
+First, you'll need to add two new instructions:  
+
+* Opcode 3 takes a single integer as input and saves it to the position given by its only parameter. For example, the instruction 3,50 would take an input value and store it at address 50.  
+* Opcode 4 outputs the value of its only parameter. For example, the instruction 4,50 would output the value at address 50.  
+
+Programs that use these instructions will come with documentation that explains what should be connected to the input and output. The program 3,0,4,0,99 outputs whatever it gets as input, then halts.  
+
+Second, you'll need to add support for parameter modes:  
+
+Each parameter of an instruction is handled based on its parameter mode. Right now, your ship computer already understands parameter mode 0, position mode, which causes the parameter to be interpreted as a position - if the parameter is 50, its value is the value stored at address 50 in emory. Until now, all parameters have been in position mode.  
+
+Now, your ship computer will also need to handle parameters in mode 1, immediate mode. In immediate mode, a parameter is interpreted as a value - if the parameter is 50, its value is simply 50.  
+
+Parameter modes are stored in the same value as the instruction's opcode. The opcode is a two-digit number based only on the ones and tens digit of the value, that is, the opcode is the rightmost two digits of the first value in an instruction. Parameter modes are single digits, one per parameter, read right-to-left from the opcode: the first parameter's mode is in the hundreds digit, the second parameter's mode is in the thousands digit, the third parameter's mode is in the ten-thousands digit, and so on. Any missing modes are 0.  
+
+For example, consider the program 1002,4,3,4,33.  
+
+The first instruction, 1002,4,3,4, is a multiply instruction - the rightmost two digits of the first value, 02, indicate opcode 2, multiplication. Then, going right to left, the parameter modes are 0 (hundreds digit), 1 (thousands digit), and 0 (ten-thousands digit, not present and therefore zero):  
+
+<pre>
+ABCDE
+ 1002
+
+DE - two-digit opcode,      02 == opcode 2
+ C - mode of 1st parameter,  0 == position mode
+ B - mode of 2nd parameter,  1 == immediate mode
+ A - mode of 3rd parameter,  0 == position mode,
+                                  omitted due to being a leading zero
+</pre>                                  
+                                  
+This instruction multiplies its first two parameters. The first parameter, 4 in position mode, works like it did before - its value is the value stored at address 4 (33). The second parameter, 3 in immediate mode, simply has value 3. The result of this operation, 33 * 3 = 99, is written according to the third parameter, 4 in position mode, which also works like it did before - 99 is written to address 4.  
+
+Parameters that an instruction writes to will never be in immediate mode.  
+
+Finally, some notes:  
+
+It is important to remember that the instruction pointer should increase by the number of values in the instruction after the instruction finishes. Because of the new instructions, this amount is no longer always 4.  
+
+Integers can be negative: 1101,100,-1,4,0 is a valid program (find 100 + -1, store the result in position 4).  
+The TEST diagnostic program will start by requesting from the user the ID of the system to test by running an input instruction - provide it 1, the ID for the ship's air conditioner unit.  
+
+It will then perform a series of diagnostic tests confirming that various parts of the Intcode computer, like parameter modes, function correctly. For each test, it will run an output instruction indicating how far the result of the test was from the expected value, where 0 means the test was successful. Non-zero outputs mean that a function is not working correctly; check the instructions that were run before the output instruction to see which one failed.  
+
+Finally, the program will output a diagnostic code and immediately halt. This final output isn't an error; an output followed immediately by a halt means the program finished. If all outputs were zero except the diagnostic code, the diagnostic program ran successfully.  
+
+After providing 1 to the only input instruction and passing all the tests, what diagnostic code does the program produce?
diff --git a/2019/assignments/Day7.md b/2019/assignments/Day7.md
@@ -1,41 +1,47 @@
 **--- Day 7: Amplification Circuit ---**
 
-Based on the navigational maps, you're going to need to send more power to your ship's thrusters to reach Santa in time. To do this, you'll need to configure a series of amplifiers already installed on the ship.
+Based on the navigational maps, you're going to need to send more power to your ship's thrusters to reach Santa in time. To do this, you'll need to configure a series of amplifiers already installed on the ship.  
 
-There are five amplifiers connected in series; each one receives an input signal and produces an output signal. They are connected such that the first amplifier's output leads to the second amplifier's input, the second amplifier's output leads to the third amplifier's input, and so on. The first amplifier's input value is 0, and the last amplifier's output leads to your ship's thrusters.
+There are five amplifiers connected in series; each one receives an input signal and produces an output signal. They are connected such that the first amplifier's output leads to the second amplifier's input, the second amplifier's output leads to the third amplifier's input, and so on. The first amplifier's input value is 0, and the last amplifier's output leads to your ship's thrusters.  
 
+<pre>
     O-------O  O-------O  O-------O  O-------O  O-------O
 0 ->| Amp A |->| Amp B |->| Amp C |->| Amp D |->| Amp E |-> (to thrusters)
     O-------O  O-------O  O-------O  O-------O  O-------O
+</pre>    
     
-The Elves have sent you some Amplifier Controller Software (your puzzle input), a program that should run on your existing Intcode computer. Each amplifier will need to run a copy of the program.
+The Elves have sent you some Amplifier Controller Software (your puzzle input), a program that should run on your existing Intcode computer. Each amplifier will need to run a copy of the program.  
 
-When a copy of the program starts running on an amplifier, it will first use an input instruction to ask the amplifier for its current phase setting (an integer from 0 to 4). Each phase setting is used exactly once, but the Elves can't remember which amplifier needs which phase setting.
+When a copy of the program starts running on an amplifier, it will first use an input instruction to ask the amplifier for its current phase setting (an integer from 0 to 4). Each phase setting is used exactly once, but the Elves can't remember which amplifier needs which phase setting.  
 
-The program will then call another input instruction to get the amplifier's input signal, compute the correct output signal, and supply it back to the amplifier with an output instruction. (If the amplifier has not yet received an input signal, it waits until one arrives.)
+The program will then call another input instruction to get the amplifier's input signal, compute the correct output signal, and supply it back to the amplifier with an output instruction. (If the amplifier has not yet received an input signal, it waits until one arrives.)  
 
-Your job is to find the largest output signal that can be sent to the thrusters by trying every possible combination of phase settings on the amplifiers. Make sure that memory is not shared or reused between copies of the program.
+Your job is to find the largest output signal that can be sent to the thrusters by trying every possible combination of phase settings on the amplifiers. Make sure that memory is not shared or reused between copies of the program.  
 
-For example, suppose you want to try the phase setting sequence 3,1,2,4,0, which would mean setting amplifier A to phase setting 3, amplifier B to setting 1, C to 2, D to 4, and E to 0. Then, you could determine the output signal that gets sent from amplifier E to the thrusters with the following steps:
+For example, suppose you want to try the phase setting sequence 3,1,2,4,0, which would mean setting amplifier A to phase setting 3, amplifier B to setting 1, C to 2, D to 4, and E to 0. Then, you could determine the output signal that gets sent from amplifier E to the thrusters with the following steps  
 
-Start the copy of the amplifier controller software that will run on amplifier A. At its first input instruction, provide it the amplifier's phase setting, 3. At its second input instruction, provide it the input signal, 0. After some calculations, it will use an output instruction to indicate the amplifier's output signal.
-Start the software for amplifier B. Provide it the phase setting (1) and then whatever output signal was produced from amplifier A. It will then produce a new output signal destined for amplifier C.
-Start the software for amplifier C, provide the phase setting (2) and the value from amplifier B, then collect its output signal.
-Run amplifier D's software, provide the phase setting (4) and input value, and collect its output signal.
-Run amplifier E's software, provide the phase setting (0) and input value, and collect its output signal.
-The final output signal from amplifier E would be sent to the thrusters. However, this phase setting sequence may not have been the best one; another sequence might have sent a higher signal to the thrusters.
+* Start the copy of the amplifier controller software that will run on amplifier A. At its first input instruction, provide it the amplifier's phase setting, 3. At its second input instruction, provide it the input signal, 0. After some calculations, it will use an output instruction to indicate the amplifier's output signal.  
+* Start the software for amplifier B. Provide it the phase setting (1) and then whatever output signal was produced from amplifier A. It will then produce a new output signal destined for amplifier C.  
+* Start the software for amplifier C, provide the phase setting (2) and the value from amplifier B, then collect its output signal.  
+* Run amplifier D's software, provide the phase setting (4) and input value, and collect its output signal.  
+* Run amplifier E's software, provide the phase setting (0) and input value, and collect its output signal.  
 
-Here are some example programs:
+The final output signal from amplifier E would be sent to the thrusters. However, this phase setting sequence may not have been the best one; another sequence might have sent a higher signal to the thrusters.  
 
-Max thruster signal 43210 (from phase setting sequence 4,3,2,1,0):
+Here are some example programs:  
 
-3,15,3,16,1002,16,10,16,1,16,15,15,4,15,99,0,0
-Max thruster signal 54321 (from phase setting sequence 0,1,2,3,4):
+Max thruster signal 43210 (from phase setting sequence 4,3,2,1,0):  
+
+3,15,3,16,1002,16,10,16,1,16,15,15,4,15,99,0,0  
+
+Max thruster signal 54321 (from phase setting sequence 0,1,2,3,4):  
 
 3,23,3,24,1002,24,10,24,1002,23,-1,23,
-101,5,23,23,1,24,23,23,4,23,99,0,0
-Max thruster signal 65210 (from phase setting sequence 1,0,4,3,2):
+101,5,23,23,1,24,23,23,4,23,99,0,0  
+
+Max thruster signal 65210 (from phase setting sequence 1,0,4,3,2):  
 
 3,31,3,32,1002,32,10,32,1001,31,-2,31,1007,31,0,33,
-1002,33,7,33,1,33,31,31,1,32,31,31,4,31,99,0,0,0
-Try every combination of phase settings on the amplifiers. What is the highest signal that can be sent to the thrusters?
+1002,33,7,33,1,33,31,31,1,32,31,31,4,31,99,0,0,0  
+
+Try every combination of phase settings on the amplifiers. What is the highest signal that can be sent to the thrusters?  
diff --git a/2019/data/Day5.txt b/2019/data/Day5.txt
diff --git a/2019/data/Day7.txt b/2019/data/Day7.txt

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`# Part 1 ------------------------------------------------------------------`
`2`		`-`
	`2`	`+rm(list = ls())`
`3`	`3`
`4`	`4`
`5`	`5`