Merge pull request #44 from WeiiswurstDev/master

Days 5,7,8 and 9 in typescript

Author: JohnnyJayJay

Day-05/typescript/WeiiswurstDev/index.ts

@@ -0,0 +1,34 @@
+import fs from 'fs'
+import {EOL} from 'os'
+
+const input = fs.readFileSync("input.txt").toString().split(EOL).sort()
+console.log(input.length)
+
+function toBin(x:string,binaryOne:string) {
+  let current = 0;
+  for(let i = 0; i < x.length; i++)
+    current += (x[i]==binaryOne?1:0)*(Math.pow(2,x.length-i) / 2)
+  return current;
+}
+
+
+let maxSeatId = 0;
+let lastCol = 0;
+let ignoreRow = -1;
+for(let line of input) {
+  let row = toBin(line.substring(0,7),"B")
+  let col = toBin(line.substring(7,line.length),"R")
+  //console.log(line,line.substring(0,7),row,line.substring(7,line.length),col)
+  let seatId = row*8+col;
+  if(seatId > maxSeatId) maxSeatId = seatId;
+
+  if(col-lastCol == 0) ignoreRow = row-1;
+  else if(row==ignoreRow) ignoreRow = -1;
+  // My poor attempt at part 2, I fiddled with this if statement until it spat out numbers in "Part 2", then tried the sensible numbers.
+  // Do not repeat.
+  //else if(col-lastCol != 1 && col-lastCol != -7  && row > 2) console.log("Part 2",seatId)
+  lastCol = col;
+}
+
+console.log("Part 1",maxSeatId)
+console.log("No solution for part 2. Please use another solution.")

Day-07/typescript/WeiiswurstDev/index.ts

@@ -0,0 +1,55 @@
+import fs from 'fs'
+import {EOL} from 'os'
+
+const input = fs.readFileSync("input.txt").toString().split(EOL)
+
+type BagContainList = {
+  color:string,
+  amount:number
+}[];
+
+type BagList = {
+  [key: string]: BagContainList
+}
+
+const bags: BagList = {}
+
+for(let line of input) {
+  const split = line.split(" ");
+  const contains:BagContainList = [];
+  if(split[4] != "no") for(let i = 4; i < split.length; i+=4)
+    contains.push({
+      color:split[i+1]+" "+split[i+2], 
+      amount:Number.parseInt(split[i])
+    });
+  bags[split[0]+" "+split[1]] = contains;
+}
+
+let part1total = 0;
+
+for(let bag in bags) {
+  if(checkBag(bags[bag])) part1total++;
+}
+
+function checkBag(containList:BagContainList):boolean {
+  let hasGoldenBag = false;
+  for(let contains of containList) {
+    if(contains.color == "shiny gold") return true;
+    else if(checkBag(bags[contains.color])) {
+      hasGoldenBag = true;
+      break;
+    }
+  }
+  return hasGoldenBag;
+}
+
+function countBagsInside(bagList:BagContainList):number {
+  let count = 1;
+  for(let bag of bagList) {
+    count += countBagsInside(bags[bag.color])*bag.amount;
+  }
+  return count;
+}
+
+console.log("Part 1",part1total)
+console.log("Part 2",countBagsInside(bags["shiny gold"])-1)

Day-08/typescript/WeiiswurstDev/index.ts

@@ -0,0 +1,38 @@
+import fs from 'fs'
+import {EOL} from 'os'
+
+const input = fs.readFileSync("input.txt").toString().split(EOL)
+
+const linesVisited = new Set<number>();
+
+let part = 1;
+
+function exec(acc:number,line:number):any {
+  if(line >= input.length) return false;
+  if(linesVisited.has(line)) {
+    if(part == 1) console.log("Part 1",acc)
+    return true;
+  }
+  linesVisited.add(line)
+  const split = input[line].split(" ");
+  const exp = split[0]
+  if(exp=="nop") {
+    return exec(acc,line+1)
+  }
+  else if(exp=="jmp") return exec(acc,line+parseNumber(split[1]))
+  else if(exp=="acc") {
+    acc+=parseNumber(split[1])
+    return exec(acc,line+1)
+  }
+}
+
+function parseNumber(number:string):number {
+  if(number[0]=="+") return Number.parseInt(number.substring(1,number.length))
+  else return Number.parseInt(number)
+}
+
+exec(0,0)
+
+part = 2;
+
+console.log("No solution for Part 2 (yet). I might add one when I find time for it.")

Day-09/typescript/WeiiswurstDev/index.ts

@@ -0,0 +1,50 @@
+import {readFileSync} from 'fs'
+import {EOL} from 'os'
+
+const input = readFileSync("input.txt").toString().split(EOL).map(line=>Number.parseInt(line))
+
+const last25:number[] = []
+let counter = 0;
+const sums:number[] = [];
+
+let part1 = 0;
+
+for(let num of input) {
+  if(last25.length != 25) {
+    last25.push(num)
+    if(last25.length == 25)
+      for(let x of last25)
+        for(let y of last25)
+          sums.push(x+y)
+  } else {
+    if(!sums.includes(num)) {
+      part1 = num;
+      break;
+    }
+    last25[counter] = num;
+    for(let i = 0; i < 25; i++) {
+      sums[i+counter*25] = num+last25[i];
+    }
+    counter++;
+    if(counter==25) counter=0;
+  }
+}
+
+console.log("Part 1",part1)
+
+for(let i = 0; i < input.length; i++) {
+  let sum = input[i];
+  let j = i;
+  let smallest = Number.MAX_VALUE;
+  let largest = Number.MIN_VALUE;
+  while(sum < part1) {
+    j++
+    sum += input[j]
+    smallest = Math.min(smallest,input[j])
+    largest = Math.max(largest,input[j])
+  }
+  if(sum == part1) {
+    console.log("Part 2",smallest+largest)
+    break;
+  }
+}