Merge pull request devcordde#1 from devcordde/master

Update fork

Author: Th3Ph4nt0m

Day-01/typescript/.gitignore

@@ -1,3 +1,6 @@
+
+// PLEASE READ THE README.md IN MY SHARED FOLDER! 
+
 import fs from 'fs'
 import { EOL } from 'os'
 

Day-01/typescript/WeiiswurstDev/.gitignore

@@ -0,0 +1,53 @@
+import java.io.File
+
+fun main() {
+ val file = File("./src/main/kotlin/day-02-input")
+
+ val inputArray: List<String> = file.bufferedReader().readLines()
+
+ var counter = 0
+
+ for(i in inputArray.indices) {
+ val split: List<String> = inputArray[i].split(" ")
+
+ val numbers = split[0]
+ val letter = split[1].replace(":", "")
+ val password = split[2]
+
+ var charCounter = 0
+ for(char in password.subSequence(password.indices)) {
+ if(char == letter[0])
+ charCounter++
+ }
+
+ if(charCounter <= numbers.split("-")[1].toInt() && charCounter >= numbers.split("-")[0].toInt())
+ counter++
+ }
+
+ println("PartOne:")
+ println(counter)
+
+ counter = 0
+ for(i in inputArray.indices) {
+ val split: List<String> = inputArray[i].split(" ")
+
+ val numbers = split[0]
+ val letter = split[1].replace(":", "")
+ val password = split[2]
+
+ val firstNumber = numbers.split("-")[0].toInt()
+ val secondNumber = numbers.split("-")[1].toInt()
+
+ if (password[firstNumber -1] == letter[0]) {
+ if (password[secondNumber -1] != letter[0]) {
+ counter++
+ }
+ } else {
+ if (password[secondNumber -1] == letter[0]) {
+ counter++
+ }
+ }
+ }
+ println("PartTwo:")
+ println(counter)
+}

Day-01/typescript/WeiiswurstDev/README.md

@@ -0,0 +1,37 @@
+
+// Please read the README.md in my shared folder!
+
+import fs from 'fs'
+import { EOL } from 'os'
+
+const input = fs.readFileSync("input.txt").toString().split(EOL);
+
+let validEntries = 0;
+let part2validEntries = 0;
+
+for(let entry of input) {
+ let split = entry.split(" ")
+ let amounts = split[0].split("-").map(num=>Number.parseInt(num))
+ let limitedChar = split[1].substring(0,1)
+ let pass = split[2]
+
+ let actualAmount = 0;
+ for(let char of pass) {
+ if(limitedChar == char) actualAmount++;
+ }
+ if(actualAmount >= amounts[0] && actualAmount <= amounts[1]) {
+ validEntries++;
+ }
+
+ let correctIndexes = 0;
+
+ for(let index of amounts) {
+ let char = pass[index-1];
+ if(char == limitedChar)
+ correctIndexes++;
+ }
+ if(correctIndexes == 1) part2validEntries++;
+}
+
+console.log("Part 1",validEntries)
+console.log("Part 2",part2validEntries)

Day-01/typescript/WeiiswurstDev/index.ts

@@ -0,0 +1,43 @@
+// Read my README in shared/JohnnyJayJay
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "../../../shared/JohnnyJayJay/aoc.h"
+
+int traverse(u_int32_t* levels, int lines, int width, int x_step, int y_step) {
+ int x_pos = 0;
+ int tree_count = 0;
+ for (int i = 0; i < lines; i += y_step) {
+ u_int32_t level = levels[i];
+ if ((level >> (width - 1 - x_pos)) & ((u_int32_t) 1)) {
+ tree_count++;
+ }
+ x_pos = (x_pos + x_step) % width;
+ }
+ return tree_count;
+}
+
+int main(int argc, char** argv) {
+ FILE* file = fopen(argv[1], "r");
+ int lines = count_lines(file);
+ int width = chars_until(file, '\n');
+ u_int32_t* levels = malloc(sizeof(u_int32_t) * lines);
+ for (int i = 0; i < lines; i++) {
+ u_int32_t level = 0;
+ char spot;
+ while ((spot = fgetc(file)) != '\n' && spot != EOF) {
+ level <<= 1;
+ level |= spot == '#';
+ }
+ levels[i] = level;
+ }
+ 
+ u_int64_t first = traverse(levels, lines, width, 3, 1);
+ printf("You encounter %lu trees the first slope.\n", first);
+ u_int64_t second = traverse(levels, lines, width, 1, 1);
+ u_int64_t third = traverse(levels, lines, width, 5, 1);
+ u_int64_t fourth = traverse(levels, lines, width, 7, 1);
+ u_int64_t fiveth = traverse(levels, lines, width, 1, 2);
+ printf("The trees on all slopes multiplied together: %lu\n", first * second * third * fourth * fiveth);
+ 
+}

Day-01/typescript/WeiiswurstDev/package.json

@@ -0,0 +1 @@
+*.txt

Day-02/kotlin/warriorzz/solution.kt

@@ -0,0 +1,2 @@
+# Kotlin Solution
+I recommend to use [kscript](https://github.com/holgerbrandl/kscript) by [@holgerbrandl](https://github.com/holgerbrandl) to execute the script file.