day1
This commit is contained in:
2
.gitignore
vendored
Normal file
2
.gitignore
vendored
Normal file
@@ -0,0 +1,2 @@
|
|||||||
|
target
|
||||||
|
.vscode
|
||||||
7
2023/day1/Cargo.lock
generated
Normal file
7
2023/day1/Cargo.lock
generated
Normal file
@@ -0,0 +1,7 @@
|
|||||||
|
# This file is automatically @generated by Cargo.
|
||||||
|
# It is not intended for manual editing.
|
||||||
|
version = 3
|
||||||
|
|
||||||
|
[[package]]
|
||||||
|
name = "day1"
|
||||||
|
version = "0.1.0"
|
||||||
6
2023/day1/Cargo.toml
Normal file
6
2023/day1/Cargo.toml
Normal file
@@ -0,0 +1,6 @@
|
|||||||
|
[package]
|
||||||
|
name = "day1"
|
||||||
|
version = "0.1.0"
|
||||||
|
edition = "2021"
|
||||||
|
|
||||||
|
[dependencies]
|
||||||
29
2023/day1/README.md
Normal file
29
2023/day1/README.md
Normal file
@@ -0,0 +1,29 @@
|
|||||||
|
# Day 1: Trebuchet?!
|
||||||
|
|
||||||
|
Something is wrong with global snow production, and you've been selected to take a look. The Elves have even given you a map; on it, they've used stars to mark the top fifty locations that are likely to be having problems.
|
||||||
|
|
||||||
|
You've been doing this long enough to know that to restore snow operations, you need to check all fifty stars by December 25th.
|
||||||
|
|
||||||
|
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!
|
||||||
|
|
||||||
|
You try to ask why they can't just use a weather machine ("not powerful enough") and where they're even sending you ("the sky") and why your map looks mostly blank ("you sure ask a lot of questions") and hang on did you just say the sky ("of course, where do you think snow comes from") when you realize that the Elves are already loading you into a trebuchet ("please hold still, we need to strap you in").
|
||||||
|
|
||||||
|
As they're making the final adjustments, they discover that their calibration document (your puzzle input) has been amended by a very young Elf who was apparently just excited to show off her art skills. Consequently, the Elves are having trouble reading the values on the document.
|
||||||
|
|
||||||
|
The newly-improved calibration document consists of lines of text; each line originally contained a specific calibration value that the Elves now need to recover. On each line, the calibration value can be found by combining the first digit and the last digit (in that order) to form a single two-digit number.
|
||||||
|
|
||||||
|
For example:
|
||||||
|
|
||||||
|
1abc2
|
||||||
|
pqr3stu8vwx
|
||||||
|
a1b2c3d4e5f
|
||||||
|
treb7uchet
|
||||||
|
|
||||||
|
In this example, the calibration values of these four lines are 12, 38, 15, and 77. Adding these together produces 142.
|
||||||
|
|
||||||
|
Consider your entire calibration document. What is the sum of all of the calibration values?
|
||||||
|
|
||||||
|
To begin, get your puzzle input.
|
||||||
|
|
||||||
|
Answer:
|
||||||
|
You can also [Shareon Twitter Mastodon] this puzzle.
|
||||||
1000
2023/day1/src/input
Normal file
1000
2023/day1/src/input
Normal file
File diff suppressed because it is too large
Load Diff
47
2023/day1/src/main.rs
Normal file
47
2023/day1/src/main.rs
Normal file
@@ -0,0 +1,47 @@
|
|||||||
|
use std::fs::File;
|
||||||
|
use std::io::{self, BufRead};
|
||||||
|
use std::path::Path;
|
||||||
|
|
||||||
|
fn main() -> io::Result<()> {
|
||||||
|
// File must exist in the current path
|
||||||
|
let mut result = 0;
|
||||||
|
if let Ok(lines) = read_lines("./src/input") {
|
||||||
|
for line in lines.flatten() {
|
||||||
|
if let Some(value) = extract_digit_pair_sum(&line) {
|
||||||
|
println!("Current result: {} + {} = {}", result, value, result + value);
|
||||||
|
result += value;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
println!("Final result: {}", result);
|
||||||
|
Ok(())
|
||||||
|
}
|
||||||
|
|
||||||
|
// Extracts first and last digits from a line, forms a number, and returns the sum
|
||||||
|
fn extract_digit_pair_sum(line: &str) -> Option<i32> {
|
||||||
|
let first_digit = get_first_digit(line)?;
|
||||||
|
let last_digit = get_last_digit(line)?;
|
||||||
|
|
||||||
|
let digit_str = format!("{}{}", first_digit, last_digit);
|
||||||
|
digit_str.parse::<i32>().ok()
|
||||||
|
}
|
||||||
|
|
||||||
|
// Helper function to get the first digit in the string
|
||||||
|
fn get_first_digit(s: &str) -> Option<char> {
|
||||||
|
s.chars().find(|&c| c.is_digit(10))
|
||||||
|
}
|
||||||
|
|
||||||
|
// Helper function to get the last digit in the string
|
||||||
|
fn get_last_digit(s: &str) -> Option<char> {
|
||||||
|
s.chars().rev().find(|&c| c.is_digit(10))
|
||||||
|
}
|
||||||
|
|
||||||
|
// Returns an Iterator over the lines in the file
|
||||||
|
fn read_lines<P>(filename: P) -> io::Result<io::Lines<io::BufReader<File>>>
|
||||||
|
where
|
||||||
|
P: AsRef<Path>,
|
||||||
|
{
|
||||||
|
let file = File::open(filename)?;
|
||||||
|
Ok(io::BufReader::new(file).lines())
|
||||||
|
}
|
||||||
Reference in New Issue
Block a user