Added AOC 2022 day 01

www/internals/modules/adventofcode.php

@@ -9,6 +9,7 @@ class AdventOfCode implements IWebsiteModule
 		'2019' => [ 'url-aoc'=>'https://adventofcode.com/2019/day/', 'blog-id' => 24, 'github' => 'https://github.com/Mikescher/AdventOfCode2019', 'single_solution_file' => false ],
 		'2020' => [ 'url-aoc'=>'https://adventofcode.com/2020/day/', 'blog-id' => 26, 'github' => 'https://github.com/Mikescher/AdventOfCode2020', 'single_solution_file' => true  ],
 		'2021' => [ 'url-aoc'=>'https://adventofcode.com/2021/day/', 'blog-id' => 27, 'github' => 'https://github.com/Mikescher/AdventOfCode2021', 'single_solution_file' => true  ],
+		'2022' => [ 'url-aoc'=>'https://adventofcode.com/2022/day/', 'blog-id' => 28, 'github' => 'https://github.com/Mikescher/AdventOfCode2022', 'single_solution_file' => false ],
 	];
 
 	const LANGUAGES =
@@ -23,6 +24,7 @@ class AdventOfCode implements IWebsiteModule
 		'js'   => ['ext'=>'js',   'css'=>'language-javascript',    'name'=>'Javascript'],
 		'pas'  => ['ext'=>'pas',  'css'=>'language-pascal',        'name'=>'Pascal/Delphi'],
 		'ts'   => ['ext'=>'ts',   'css'=>'language-typescript',    'name'=>'Typescript'],
+		'nim'  => ['ext'=>'nim',  'css'=>'language-nim',           'name'=>'Nim'],
 	];
 
 	/** @var array */

www/statics/aoc/2022/01_challenge.txt

@@ -0,0 +1,50 @@
+--- Day 1: Calorie Counting ---
+
+Santa's reindeer typically eat regular reindeer food, but they need a lot of magical energy to deliver presents on Christmas. For that, their favorite snack is a special type of star fruit that only grows deep in the jungle. The Elves have brought you on their annual expedition to the grove where the fruit grows.
+
+To supply enough magical energy, the expedition needs to retrieve a minimum of fifty stars by December 25th. Although the Elves assure you that the grove has plenty of fruit, you decide to grab any fruit you see along the way, just in case.
+
+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!
+
+The jungle must be too overgrown and difficult to navigate in vehicles or access from the air; the Elves' expedition traditionally goes on foot. As your boats approach land, the Elves begin taking inventory of their supplies. One important consideration is food - in particular, the number of Calories each Elf is carrying (your puzzle input).
+
+The Elves take turns writing down the number of Calories contained by the various meals, snacks, rations, etc. that they've brought with them, one item per line. Each Elf separates their own inventory from the previous Elf's inventory (if any) by a blank line.
+
+For example, suppose the Elves finish writing their items' Calories and end up with the following list:
+
+1000
+2000
+3000
+
+4000
+
+5000
+6000
+
+7000
+8000
+9000
+
+10000
+
+This list represents the Calories of the food carried by five Elves:
+
+    The first Elf is carrying food with 1000, 2000, and 3000 Calories, a total of 6000 Calories.
+    The second Elf is carrying one food item with 4000 Calories.
+    The third Elf is carrying food with 5000 and 6000 Calories, a total of 11000 Calories.
+    The fourth Elf is carrying food with 7000, 8000, and 9000 Calories, a total of 24000 Calories.
+    The fifth Elf is carrying one food item with 10000 Calories.
+
+In case the Elves get hungry and need extra snacks, they need to know which Elf to ask: they'd like to know how many Calories are being carried by the Elf carrying the most Calories. In the example above, this is 24000 (carried by the fourth Elf).
+
+Find the Elf carrying the most Calories. How many total Calories is that Elf carrying?
+
+--- Part Two ---
+
+By the time you calculate the answer to the Elves' question, they've already realized that the Elf carrying the most Calories of food might eventually run out of snacks.
+
+To avoid this unacceptable situation, the Elves would instead like to know the total Calories carried by the top three Elves carrying the most Calories. That way, even if one of those Elves runs out of snacks, they still have two backups.
+
+In the example above, the top three Elves are the fourth Elf (with 24000 Calories), then the third Elf (with 11000 Calories), then the fifth Elf (with 10000 Calories). The sum of the Calories carried by these three elves is 45000.
+
+Find the top three Elves carrying the most Calories. How many Calories are those Elves carrying in total?

www/statics/aoc/2022/01_solution-1.nim

@@ -0,0 +1,27 @@
+import std/strutils
+import std/algorithm
+
+proc run01_1(): string =
+
+    const input = staticRead"../input/day01.txt"
+
+    var elves = newSeq[int]()
+
+    var counter = 0
+
+    for line in splitLines(input):
+        if line == "":
+            elves.add(counter)
+            counter = 0
+        else:
+            counter += parseInt(line)
+
+    elves.sort(system.cmp, Descending)
+
+    return intToStr(elves[0])
+
+when not defined(js):
+    echo run01_1()
+else:
+    proc js_run01_1(): cstring {.exportc.} =
+        return cstring(run01_1())

www/statics/aoc/2022/01_solution-2.nim

@@ -0,0 +1,26 @@
+import std/strutils
+import std/algorithm
+
+proc run01_2(): string =
+    const input = staticRead"../input/day01.txt"
+
+    var elves = newSeq[int]()
+
+    var counter = 0
+
+    for line in splitLines(input):
+        if line == "":
+            elves.add(counter)
+            counter = 0
+        else:
+            counter += parseInt(line)
+
+    elves.sort(system.cmp, Descending)
+
+    return intToStr(elves[0]+elves[1]+elves[2])
+
+when not defined(js):
+    echo run01_2()
+else:
+    proc js_run01_2(): cstring {.exportc.} =
+        return cstring(run01_2())

www/statics/aoc/__all.php

@@ -99,10 +99,14 @@ return
 		  	['day' => 24, 'parts' => 2, 'title' => 'Lobby Layout',                            'language' => 'rust', 'solutions' => ['459', '4150'] ],
 		  	['day' => 25, 'parts' => 1, 'title' => 'Combo Breaker',                           'language' => 'rust', 'solutions' => ['3217885'] ],
 		],
-		'2021' => 
+		'2021' =>
 		[
 			['day' =>  1, 'parts' => 2, 'title' => 'Sonar Sweep',                             'language' => 'go',   'solutions' => ['1715', '1739'] ],
 			['day' =>  2, 'parts' => 2, 'title' => 'Dive!',                                   'language' => 'go',   'solutions' => ['1451208', '1620141160'] ],
 			['day' =>  3, 'parts' => 2, 'title' => 'Binary Diagnostic',                       'language' => 'go',   'solutions' => ['2954600', '1662846'] ],
+		],
+		'2022' =>
+		[
+			['day' =>  1, 'parts' => 2, 'title' => 'Calorie Counting',                        'language' => 'nim',  'solutions' => ['66719', '198551'] ],
 		]
 	];

www/statics/blog/__all.php

@@ -29,4 +29,5 @@ return
 	[ 'id' => 25, 'date' => '2020-01-09', 'visible' => true,  'title' => 'Advent of Code 2017 - Python3',          'fragment' => 'aoc2017.md',         'type' => 'aoc',      'cat' => 'blog', 'extras' => ['aoc:year' => '2017'] ],
 	[ 'id' => 26, 'date' => '2020-12-01', 'visible' => true,  'title' => 'Advent of Code 2020 - Rust',             'fragment' => 'aoc2020.md',         'type' => 'aoc',      'cat' => 'blog', 'extras' => ['aoc:year' => '2020'] ],
 	[ 'id' => 27, 'date' => '2021-11-25', 'visible' => true,  'title' => 'Advent of Code 2021 - Go',               'fragment' => 'aoc2021.md',         'type' => 'aoc',      'cat' => 'blog', 'extras' => ['aoc:year' => '2021'] ],
+	[ 'id' => 28, 'date' => '2022-12-01', 'visible' => true,  'title' => 'Advent of Code 2022 - Nim',              'fragment' => 'aoc2022.md',         'type' => 'aoc',      'cat' => 'blog', 'extras' => ['aoc:year' => '2022'] ],
 ];

www/statics/blog/aoc2022.md

@@ -0,0 +1 @@
+Let's try out [nim](https://nim-lang.org/)... why not