aoc 1+2

www/internals/adventofcode.php

@@ -84,7 +84,7 @@ class AdventOfCode
 
 		for ($i=1; $i <= $a['parts']; $i++)
 		{
-			$solutionfiles []= (__DIR__ . '/../statics/aoc/' . $year . '/' . $n2p . '-' . $i . '.' . self::LANGUAGES[$a['language']]['ext']);
+			$solutionfiles []= (__DIR__ . '/../statics/aoc/' . $year . '/' . $n2p . '_solution-' . $i . '.' . self::LANGUAGES[$a['language']]['ext']);
 		}
 
 		$a['file_solutions'] = $solutionfiles;

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

@@ -0,0 +1,36 @@
+--- Day 1: The Tyranny of the Rocket Equation ---
+
+Santa has become stranded at the edge of the Solar System while delivering presents to other planets! To accurately calculate his position in space, safely align his warp drive, and return to Earth in time to save Christmas, he needs you to bring him measurements from fifty stars.
+
+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 Elves quickly load you into a spacecraft and prepare to launch.
+
+At the first Go / No Go poll, every Elf is Go until the Fuel Counter-Upper. They haven't determined the amount of fuel required yet.
+
+Fuel required to launch a given module is based on its mass. Specifically, to find the fuel required for a module, take its mass, divide by three, round down, and subtract 2.
+
+For example:
+
+    For a mass of 12, divide by 3 and round down to get 4, then subtract 2 to get 2.
+    For a mass of 14, dividing by 3 and rounding down still yields 4, so the fuel required is also 2.
+    For a mass of 1969, the fuel required is 654.
+    For a mass of 100756, the fuel required is 33583.
+
+The Fuel Counter-Upper needs to know the total fuel requirement. To find it, individually calculate the fuel needed for the mass of each module (your puzzle input), then add together all the fuel values.
+
+What is the sum of the fuel requirements for all of the modules on your spacecraft?
+
+--- Part Two ---
+
+During the second Go / No Go poll, the Elf in charge of the Rocket Equation Double-Checker stops the launch sequence. Apparently, you forgot to include additional fuel for the fuel you just added.
+
+Fuel itself requires fuel just like a module - take its mass, divide by three, round down, and subtract 2. However, that fuel also requires fuel, and that fuel requires fuel, and so on. Any mass that would require negative fuel should instead be treated as if it requires zero fuel; the remaining mass, if any, is instead handled by wishing really hard, which has no mass and is outside the scope of this calculation.
+
+So, for each module mass, calculate its fuel and add it to the total. Then, treat the fuel amount you just calculated as the input mass and repeat the process, continuing until a fuel requirement is zero or negative. For example:
+
+    A module of mass 14 requires 2 fuel. This fuel requires no further fuel (2 divided by 3 and rounded down is 0, which would call for a negative fuel), so the total fuel required is still just 2.
+    At first, a module of mass 1969 requires 654 fuel. Then, this fuel requires 216 more fuel (654 / 3 - 2). 216 then requires 70 more fuel, which requires 21 fuel, which requires 5 fuel, which requires no further fuel. So, the total fuel required for a module of mass 1969 is 654 + 216 + 70 + 21 + 5 = 966.
+    The fuel required by a module of mass 100756 and its fuel is: 33583 + 11192 + 3728 + 1240 + 411 + 135 + 43 + 12 + 2 = 50346.
+
+What is the sum of the fuel requirements for all of the modules on your spacecraft when also taking into account the mass of the added fuel? (Calculate the fuel requirements for each module separately, then add them all up at the end.)

www/statics/aoc/2019/01_input.txt

@@ -0,0 +1,100 @@
+63455
+147371
+83071
+57460
+74392
+145303
+130181
+53102
+120073
+93111
+144471
+105327
+116466
+67222
+122845
+146097
+92014
+114428
+96796
+131140
+101481
+87953
+101415
+75739
+64263
+94257
+140426
+62387
+84464
+104547
+103581
+89121
+123301
+64993
+143555
+55246
+120986
+67596
+146173
+149707
+60285
+83517
+73782
+103464
+140506
+78400
+140672
+141638
+84470
+116879
+100701
+63976
+135748
+65021
+120086
+147249
+55441
+135315
+147426
+93676
+91384
+110918
+123368
+102430
+144807
+82761
+134357
+62990
+85171
+134886
+69166
+119744
+80648
+96752
+89379
+136178
+95175
+124306
+51990
+57564
+111347
+79317
+95357
+85765
+137827
+105014
+110742
+105014
+149330
+78437
+107908
+139044
+143304
+90614
+52119
+147113
+119815
+125634
+104335
+138295

www/statics/aoc/2019/01_solution-1.ts

@@ -0,0 +1,20 @@
+namespace AdventOfCode2019_01_1
+{
+	const DAY     = 1;
+	const PROBLEM = 1;
+
+	export async function run()
+	{
+		let input = await AdventOfCode.getInput(DAY);
+		if (input == null) return;
+
+		const fuel = input
+			.split(new RegExp('\r?\n'))
+			.filter(p => p.trim().length > 0)
+			.map(p => parseInt(p))
+			.map(p => Math.floor(p/3) - 2)
+			.reduce((a,b) => a+b);
+
+			AdventOfCode.output(DAY, PROBLEM, fuel.toString());
+	}
+}

www/statics/aoc/2019/01_solution-2.ts

@@ -0,0 +1,32 @@
+namespace AdventOfCode2019_01_2
+{
+	const DAY     = 1;
+	const PROBLEM = 2;
+
+	export async function run()
+	{
+		let input = await AdventOfCode.getInput(DAY);
+		if (input == null) return;
+
+		const fuel = input
+			.split(new RegExp('\r?\n'))
+			.filter(p => p.trim().length > 0)
+			.map(p => parseInt(p))
+			.map(mass => 
+			{
+				let fuel = Math.floor(mass / 3) - 2;
+				let lastfuel = fuel;
+				for (; ; )
+				{
+					let newfuel = Math.floor(lastfuel / 3) - 2;
+					if (newfuel <= 0) break;
+					fuel += newfuel;
+					lastfuel = newfuel;
+				}
+				return fuel;
+			})
+			.reduce((a,b) => a+b);
+
+			AdventOfCode.output(DAY, PROBLEM, fuel.toString());
+	}
+}

www/statics/aoc/2019/02_challenge.txt

@@ -0,0 +1,71 @@
+--- Day 2: 1202 Program Alarm ---
+
+On the way to your gravity assist around the Moon, your ship computer beeps angrily about a "1202 program alarm". On the radio, an Elf is already explaining how to handle the situation: "Don't worry, that's perfectly norma--" The ship computer bursts into flames.
+
+You notify the Elves that the computer's magic smoke seems to have escaped. "That computer ran Intcode programs like the gravity assist program it was working on; surely there are enough spare parts up there to build a new Intcode computer!"
+
+An Intcode program is a list of integers separated by commas (like 1,0,0,3,99). To run one, start by looking at the first integer (called position 0). Here, you will find an opcode - either 1, 2, or 99. The opcode indicates what to do; for example, 99 means that the program is finished and should immediately halt. Encountering an unknown opcode means something went wrong.
+
+Opcode 1 adds together numbers read from two positions and stores the result in a third position. The three integers immediately after the opcode tell you these three positions - the first two indicate the positions from which you should read the input values, and the third indicates the position at which the output should be stored.
+
+For example, if your Intcode computer encounters 1,10,20,30, it should read the values at positions 10 and 20, add those values, and then overwrite the value at position 30 with their sum.
+
+Opcode 2 works exactly like opcode 1, except it multiplies the two inputs instead of adding them. Again, the three integers after the opcode indicate where the inputs and outputs are, not their values.
+
+Once you're done processing an opcode, move to the next one by stepping forward 4 positions.
+
+For example, suppose you have the following program:
+
+1,9,10,3,2,3,11,0,99,30,40,50
+
+For the purposes of illustration, here is the same program split into multiple lines:
+
+1,9,10,3,
+2,3,11,0,
+99,
+30,40,50
+
+The first four integers, 1,9,10,3, are at positions 0, 1, 2, and 3. Together, they represent the first opcode (1, addition), the positions of the two inputs (9 and 10), and the position of the output (3). To handle this opcode, you first need to get the values at the input positions: position 9 contains 30, and position 10 contains 40. Add these numbers together to get 70. Then, store this value at the output position; here, the output position (3) is at position 3, so it overwrites itself. Afterward, the program looks like this:
+
+1,9,10,70,
+2,3,11,0,
+99,
+30,40,50
+
+Step forward 4 positions to reach the next opcode, 2. This opcode works just like the previous, but it multiplies instead of adding. The inputs are at positions 3 and 11; these positions contain 70 and 50 respectively. Multiplying these produces 3500; this is stored at position 0:
+
+3500,9,10,70,
+2,3,11,0,
+99,
+30,40,50
+
+Stepping forward 4 more positions arrives at opcode 99, halting the program.
+
+Here are the initial and final states of a few more small programs:
+
+    1,0,0,0,99 becomes 2,0,0,0,99 (1 + 1 = 2).
+    2,3,0,3,99 becomes 2,3,0,6,99 (3 * 2 = 6).
+    2,4,4,5,99,0 becomes 2,4,4,5,99,9801 (99 * 99 = 9801).
+    1,1,1,4,99,5,6,0,99 becomes 30,1,1,4,2,5,6,0,99.
+
+Once you have a working computer, the first step is to restore the gravity assist program (your puzzle input) to the "1202 program alarm" state it had just before the last computer caught fire. To do this, before running the program, replace position 1 with the value 12 and replace position 2 with the value 2. What value is left at position 0 after the program halts?
+
+--- Part Two ---
+
+"Good, the new computer seems to be working correctly! Keep it nearby during this mission - you'll probably use it again. Real Intcode computers support many more features than your new one, but we'll let you know what they are as you need them."
+
+"However, your current priority should be to complete your gravity assist around the Moon. For this mission to succeed, we should settle on some terminology for the parts you've already built."
+
+Intcode programs are given as a list of integers; these values are used as the initial state for the computer's memory. When you run an Intcode program, make sure to start by initializing memory to the program's values. A position in memory is called an address (for example, the first value in memory is at "address 0").
+
+Opcodes (like 1, 2, or 99) mark the beginning of an instruction. The values used immediately after an opcode, if any, are called the instruction's parameters. For example, in the instruction 1,2,3,4, 1 is the opcode; 2, 3, and 4 are the parameters. The instruction 99 contains only an opcode and has no parameters.
+
+The address of the current instruction is called the instruction pointer; it starts at 0. After an instruction finishes, the instruction pointer increases by the number of values in the instruction; until you add more instructions to the computer, this is always 4 (1 opcode + 3 parameters) for the add and multiply instructions. (The halt instruction would increase the instruction pointer by 1, but it halts the program instead.)
+
+"With terminology out of the way, we're ready to proceed. To complete the gravity assist, you need to determine what pair of inputs produces the output 19690720."
+
+The inputs should still be provided to the program by replacing the values at addresses 1 and 2, just like before. In this program, the value placed in address 1 is called the noun, and the value placed in address 2 is called the verb. Each of the two input values will be between 0 and 99, inclusive.
+
+Once the program has halted, its output is available at address 0, also just like before. Each time you try a pair of inputs, make sure you first reset the computer's memory to the values in the program (your puzzle input) - in other words, don't reuse memory from a previous attempt.
+
+Find the input noun and verb that cause the program to produce the output 19690720. What is 100 * noun + verb? (For example, if noun=12 and verb=2, the answer would be 1202.)

www/statics/aoc/2019/02_input.txt

@@ -0,0 +1 @@
+1,0,0,3,1,1,2,3,1,3,4,3,1,5,0,3,2,1,10,19,1,19,5,23,1,6,23,27,1,27,5,31,2,31,10,35,2,35,6,39,1,39,5,43,2,43,9,47,1,47,6,51,1,13,51,55,2,9,55,59,1,59,13,63,1,6,63,67,2,67,10,71,1,9,71,75,2,75,6,79,1,79,5,83,1,83,5,87,2,9,87,91,2,9,91,95,1,95,10,99,1,9,99,103,2,103,6,107,2,9,107,111,1,111,5,115,2,6,115,119,1,5,119,123,1,123,2,127,1,127,9,0,99,2,0,14,0

www/statics/aoc/2019/02_solution-1.ts

@@ -0,0 +1,29 @@
+namespace AdventOfCode2019_02_1
+{
+	const DAY     = 2;
+	const PROBLEM = 1;
+
+	export async function run()
+	{
+		let input = await AdventOfCode.getInput(DAY);
+
+		let automata = input.split(",").map(p => parseInt(p));
+
+		automata[1] = 12;
+		automata[2] = 2;
+
+		for(let i=0; i < automata.length; i+=4)
+		{
+			const op   = automata[i+0];
+			const arg1 = automata[automata[i+1]];
+			const arg2 = automata[automata[i+2]];
+			const dest = automata[i+3];
+			console.log("["+dest+"] <- "+arg1+" {"+op+"} "+arg2)
+			if (op==1) automata[dest] = arg1 + arg2;
+			else if (op==2) automata[dest] = arg1 * arg2;
+			else break;
+		}
+
+		AdventOfCode.output(DAY, PROBLEM, automata[0].toString());
+	}
+}

www/statics/aoc/2019/02_solution-2.ts

@@ -0,0 +1,46 @@
+namespace AdventOfCode2019_02_2
+{
+	const DAY     = 2;
+	const PROBLEM = 2;
+
+	export async function run()
+	{
+		let input = await AdventOfCode.getInput(DAY);
+
+		let mem = input.split(",").map(p => parseInt(p));
+
+		for(let noun=0; noun<=99;noun++)
+		for(let verb=0; verb<=99;verb++)
+		{
+			if (exec(noun, verb, Object.assign([], mem)) == 19690720)
+			{
+				AdventOfCode.output(DAY, PROBLEM, (100*noun+verb).toString());
+				return;
+			}
+		}
+
+		AdventOfCode.output(DAY, PROBLEM, "error");
+	}
+
+	function exec(noun: number, verb: number, memory: number[])
+	{
+		let automata = memory;
+
+		automata[1] = noun;
+		automata[2] = verb;
+
+		for(let i=0; i < automata.length; i+=4)
+		{
+			const op   = automata[i+0];
+			const arg1 = automata[automata[i+1]];
+			const arg2 = automata[automata[i+2]];
+			const dest = automata[i+3];
+			
+			if (op==1) automata[dest] = arg1 + arg2;
+			else if (op==2) automata[dest] = arg1 * arg2;
+			else break;
+		}
+
+		return automata[0];
+	}
+}

www/statics/aoc/__all.php

@@ -32,6 +32,8 @@ return
 		],
 		'2019' =>
 		[
-			//
+			['day' =>  1, 'parts' => 2, 'title' => 'The Tyranny of the Rocket Equation',   'language' => 'ts', 'solutions' => ['3464458', '5193796'] ],
+			['day' =>  2, 'parts' => 2, 'title' => '1202 Program Alarm',                   'language' => 'ts', 'solutions' => ['3267740', '7870'] ],
+
 		],
 	];

www/statics/blog/__all.php

@@ -25,5 +25,5 @@ return
 	[ 'id' => 21, 'date' => '2018-01-02', 'visible' => true,  'title' => 'A simple javascript befunge-93 runner',  'fragment' => 'js_befrunner.md',    'type' => 'markdown', 'cat' => 'blog' ],
 	[ 'id' => 22, 'date' => '2018-02-06', 'visible' => true,  'title' => 'Homepage iteration 5',                   'fragment' => 'v5.md',              'type' => 'markdown', 'cat' => 'log'  ],
 	[ 'id' => 23, 'date' => '2019-11-02', 'visible' => true,  'title' => 'Advent of Code 2018',                    'fragment' => 'aoc2018.txt',        'type' => 'aoc',      'cat' => 'blog', 'extras' => ['aoc:year' => '2018'] ],
-	[ 'id' => 24, 'date' => '2019-12-01', 'visible' => false, 'title' => 'Advent of Code 2019',                    'fragment' => 'aoc2019.txt',        'type' => 'aoc',      'cat' => 'blog', 'extras' => ['aoc:year' => '2019'] ],
+	[ 'id' => 24, 'date' => '2019-12-01', 'visible' => true,  'title' => 'Advent of Code 2019',                    'fragment' => 'aoc2019.txt',        'type' => 'aoc',      'cat' => 'blog', 'extras' => ['aoc:year' => '2019'] ],
 ];

www/statics/blog/aoc2019.txt

@@ -2,4 +2,7 @@
 > "The same procedure as every year, James!"
 
 This year I will try to solve the challenges with typescript. Originally I wanted to use Befunge, but the problems don't really work that well in Befunge.
-Especially big input files are annoying to realize without I/O functions...
+Especially big input files are annoying to realize without I/O functions...
+
+This is my first real encounter with typescript (or javascript that's more than small scripts) so the resulting code should be ... suboptimal.
+But I hope I will improve :D