This repository contains my solutions to the AOC 2024 puzzles. This year, I decided to implement my solutions in C++ to practice and learn the language, focusing specifically on becoming familiar with the C++20 standard.
Each day's solution and its corresponding test input files are located in a subdirectory named day_NN, where NN represents the day number.
To compile the solutions use:
g++ -std=c++20 -o main main.cppto run the code use:
./main i input.txtwhere i is the number part (1 or 2) and input the input file. Puzzle solution's is printed in stdout.
The puzzle instructions can be found here. A brief summary of each of the statements of each problem is shown below.
The input are two list of integers (location IDs).
- Part 1: Compute the total distance between the two lists, defined as the sum of the distances between the paired numbers in increasing order.
- Part 2: Compute the total similarity score by adding up each number in the left list after multiplying it by the number of times that number appears in the right list.