Massive push of all chaotic code

Author: akulumbeg

.idea/.gitignore

@@ -0,0 +1,26 @@
+**--- Day 9: All in a Single Night ---**
+
+Every year, Santa manages to deliver all of his presents in a single night.
+
+This year, however, he has some new locations to visit; his elves have provided him the distances between every pair of locations. He can start and end at any two (different) locations he wants, but he must visit each location exactly once. What is the shortest distance he can travel to achieve this?
+
+For example, given the following distances:
+
+    London to Dublin = 464
+    London to Belfast = 518
+    Dublin to Belfast = 141
+    
+The possible routes are therefore:
+
+    Dublin -> London -> Belfast = 982
+    London -> Dublin -> Belfast = 605
+    London -> Belfast -> Dublin = 659
+    Dublin -> Belfast -> London = 659
+    Belfast -> Dublin -> London = 605
+    Belfast -> London -> Dublin = 982
+
+The shortest of these is London -> Dublin -> Belfast = 605, and so the answer is 605 in this example.
+
+*What is the distance of the shortest route?*
+
+**--- Part Two ---**

.idea/adventofcode.iml

@@ -0,0 +1,17 @@
+**--- Day 6: Probably a Fire Hazard ---**
+
+Because your neighbors keep defeating you in the holiday house decorating contest year after year, you've decided to deploy one million lights in a 1000x1000 grid.
+
+Furthermore, because you've been especially nice this year, Santa has mailed you instructions on how to display the ideal lighting configuration.
+
+Lights in your grid are numbered from 0 to 999 in each direction; the lights at each corner are at 0,0, 0,999, 999,999, and 999,0. The instructions include whether to turn on, turn off, or toggle various inclusive ranges given as coordinate pairs. Each coordinate pair represents opposite corners of a rectangle, inclusive; a coordinate pair like 0,0 through 2,2 therefore refers to 9 lights in a 3x3 square. The lights all start turned off.
+
+To defeat your neighbors this year, all you have to do is set up your lights by doing the instructions Santa sent you in order.
+
+For example:
+
+    turn on 0,0 through 999,999 would turn on (or leave on) every light.
+    toggle 0,0 through 999,0 would toggle the first line of 1000 lights, turning off the ones that were on, and turning on the ones that were off.
+    turn off 499,499 through 500,500 would turn off (or leave off) the middle four lights.
+    
+*After following the instructions, how many lights are lit?*

.idea/inspectionProfiles/profiles_settings.xml

@@ -1,18 +1,21 @@
+# Imports -----------------------------------------------------------------
+import numpy as np
+
 # Day 1 - Part 1 ----------------------------------------------------------
-with open("2015/data/day01.txt") as data:
-    aoc_input = data.read()
+with open("2015/data/day1.txt") as file:
+    inp = file.read()
 
-print(sum(+1 if inst == "(" else -1 for inst in aoc_input))
+print(sum(+1 if inst == "(" else -1 for inst in inp))
 
 # one-liner using the ternary operator and the fact that python can evaluate
 # int +1+1+1-1 as 2 implicitly
 
 # Day 1 - Part 2 ----------------------------------------------------------
-with open("2015/data/day01.txt") as data:
-    aoc_input = data.read()
+with open("2015/data/day1.txt") as file:
+    inp = file.read()
 
 floor, pos = 0, 0          # position would be 1, but python iterates from 0
-for inst in aoc_input:
+for inst in inp:
     if floor == -1:
         print(pos)
         break
@@ -24,3 +27,7 @@
     pos += 1
 
 print(pos)
+
+# one-liner alternative with numpy
+
+np.cumsum([+1 if inst == "(" else -1 for inst in inp]).tolist().index(-1)

.idea/misc.xml

@@ -0,0 +1,23 @@
+# Day 2 - Part 1 ----------------------------------------------------------
+with open("2015/data/day2.txt") as file:
+    inp = [line.strip("\n").split("x") for line in file]
+
+inp = [sorted([int(j) for j in i]) for i in inp]
+
+sides = [2*gift[0]*gift[1] + 2*gift[1]*gift[2] + 2*gift[2]*gift[0] for gift in inp]
+extra = [gift[0] * gift[1] for gift in inp]
+wrapper = [sides[i] + extra[i] for i in range(len(sides))]
+
+sum(wrapper)
+
+# Day 2 - Part 2 ----------------------------------------------------------
+with open("2015/data/day2.txt") as file:
+    inp = [line.strip("\n").split("x") for line in file]
+
+inp = [sorted([int(j) for j in i]) for i in inp]
+dist = [gift[0]*2 + gift[1]*2 for gift in inp]
+bow = [gift[0]*gift[1]*gift[2] for gift in inp]
+
+ribbon = [dist[i] + bow[i] for i in range(len(dist))]
+
+sum(ribbon)

.idea/modules.xml

@@ -31,7 +31,7 @@
 coord_s = (0, 0)                                                   # santa's initial coords
 coord_rs = (0, 0)                                                  # robo-santa's initial coords
 coords = set()                                                     # create a set (unique values only)
-coords.add((0,0))                                                  # add the initial position. It's (0,0) for both, so adding once is enough
+coords.add((0, 0))                                                 # add the initial position. It's (0,0) for both, so adding once is enough
 
 for i, x in enumerate(aoc_input):
     n = char.index(x)                                              # n is the index of the currently iterated command

.idea/vcs.xml

@@ -0,0 +1,5 @@
+# Day 5 - Part 1 ----------------------------------------------------------
+
+with open("2015/data/day5.txt") as file:
+    inp = [line.strip("\n") for line in file]
+

2015/assignments/day09.md

@@ -0,0 +1,32 @@
+# Imports -----------------------------------------------------------------
+from dis import Instruction
+import numpy as np
+import json
+
+# Day 6 - Part 1 ----------------------------------------------------------
+
+with open("2015/data/day6.txt") as file:
+    inp = [line.strip("\n")
+               .removeprefix("turn ")
+               .replace(" through ", " ")
+               .split(" ") for line in file]
+
+grid = np.zeros((1000, 1000))
+
+for instruction in inp:
+    start = np.array(json.loads("[" + instruction[1] + "]"))
+    end = np.array(json.loads("[" + instruction[2] + "]"))
+    coords = []
+    match instruction[0]:
+        case "on":
+            grid[coords[0], coords[1]] = 1
+        case "off":
+            grid[coords[0], coords[1]] = 0
+        case "toggle":
+            if grid[coords[0], coords[1]] == 0:
+                grid[coords[0], coords[1]] == 1
+            else:
+                grid[coords[0], coords[1]] == 0
+                
+
+grid.sum()

2015/assignments/day01.md renamed to 2015/assignments/day1.md

@@ -0,0 +1,30 @@
+# Day 7 - Part 1 ----------------------------------------------------------
+
+input <- readLines("2015/data/day06.txt", warn = F) # load the data
+input <- trimws(gsub("turn", "", input))
+input <- strsplit(input, " |,")
+input <- as.data.frame(matrix(data = do.call(rbind, input), ncol = 6))
+
+grid <- matrix(0, 1000,1000)
+
+switch <- function(x) {
+  
+  if (x[1] == "on") {
+    grid[x[2]:x[5], x[3]:x[6]] <- 1  
+  } else if (x[1] == "off") {
+    grid[x[2]:x[5], x[3]:x[6]] <- 0
+  } else {
+    grid[x[2]:x[5], x[3]:x[6]] <- ifelse(grid[x[2]:x[5], x[3]:x[6]] == 0, 1, 0)
+  }
+  
+  return(grid)
+  
+}
+
+apply(input, 1, switch)
+
+switch(input[,1])
+
+# Day 7 - Part 2 ----------------------------------------------------------
+
+

2015/assignments/day02.md renamed to 2015/assignments/day2.md

@@ -0,0 +1,21 @@
+# Day 9 - Part 1 ----------------------------------------------------------
+
+input <- readLines("2015/data/day09.txt", warn = F)       
+input <- strsplit(input, "( to )|( = )")
+input <- data.frame(do.call(rbind, input))
+names(input) <- c("from", "to", "dist")
+input$dist <- as.integer(input$dist)
+input$fromto <- paste0(input$from, input$to)
+
+#matrix
+names <- sort(unique(c(unique(input$from), unique(input$to))))
+matrix(input$dist, length(input$dist)/2, length(input$dist)/2)
+
+
+M <- matrix(,8,8)
+
+# Day 9 - Part 2 ----------------------------------------------------------
+
+
+x <- matrix(rnorm(100), nrow = 5)
+dist(x)

2015/assignments/day03.md renamed to 2015/assignments/day3.md

@@ -1,6 +1,6 @@
 # Day 1 - Part 1 ----------------------------------------------------------
 
-input <- readLines("2015/data/day01.txt", warn = F) # load the data
+input <- readLines("2015/data/day1.txt", warn = F) # load the data
 
 # rule - trying to avoid looping
 
@@ -13,7 +13,7 @@ sum(input)                              # sum of +1s and -1s reveals the answer/
 
 # Day 1 - Part 2 ----------------------------------------------------------
 
-input <- readLines("2015/data/day01.txt", warn = F)
+input <- readLines("2015/data/day1.txt", warn = F)
 
 # rule - trying to avoid looping
 

2015/assignments/day04.md renamed to 2015/assignments/day4.md

@@ -0,0 +1,21 @@
+# Day 10 - Part 1 ---------------------------------------------------------
+
+input <- readLines("2015/data/day10.txt", warn = F)
+  
+  
+looknsay <- function(input, times = 1) {
+  
+  
+  
+}
+
+answer <- looknsay(input, 40)
+answer
+
+
+# Day 10 - Part 2 ---------------------------------------------------------
+
+
+
+
+# Day 10 - Visualize ------------------------------------------------------

2015/assignments/day05.md renamed to 2015/assignments/day5.md

@@ -1 +1,11 @@
-#placeholder
+# 🎄 Advent of Code 2016 🎁
+
+| Assignment | Data | Solution R | Solution Python | Solution C++ | Part 1 | Part 2 |
+|-------|---|---|---|---|:-:|:-:|
+| [Day 1](https://adventofcode.com/2016/day/1) | [Data](data/day1.txt) | [R - D1](solutionsR/day1.R) |   |   | ⭐ | ⭐ |
+
+
+### Notes
+Every day's assignment links to the AOC website. However, just in case, the assignments are backed up in the *assignments* folder. The input data generated by the website is not the same for everyone. The inputs generated for me are stored in the *data* folder.
+
+![https://adventofcode.com/2016](aoc2016.png)

2015/assignments/day6.md

@@ -0,0 +1,22 @@
+**--- Day 1: No Time for a Taxicab ---**
+
+Santa's sleigh uses a very high-precision clock to guide its movements, and the clock's oscillator is regulated by stars. Unfortunately, the stars have been stolen... by the Easter Bunny. To save Christmas, Santa needs you to retrieve all fifty stars by December 25th.
+
+Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
+
+You're airdropped near Easter Bunny Headquarters in a city somewhere. "Near", unfortunately, is as close as you can get - the instructions on the Easter Bunny Recruiting Document the Elves intercepted start here, and nobody had time to work them out further.
+
+The Document indicates that you should start at the given coordinates (where you just landed) and face North. Then, follow the provided sequence: either turn left (L) or right (R) 90 degrees, then walk forward the given number of blocks, ending at a new intersection.
+
+There's no time to follow such ridiculous instructions on foot, though, so you take a moment and work out the destination. Given that you can only walk on the street grid of the city, how far is the shortest path to the destination?
+
+For example:
+
+    - Following R2, L3 leaves you 2 blocks East and 3 blocks North, or 5 blocks away.
+    - R2, R2, R2 leaves you 2 blocks due South of your starting position, which is 2 blocks away.
+    - R5, L5, R5, R3 leaves you 12 blocks away.
+
+How many blocks away is Easter Bunny HQ?
+
+**--- Part Two ---**
+