my solutions to advent of code
aoc advent-of-code

almost there

aylac.top 1185346f f624b321

verified
Changed files
+182 -2
2015
20
rust
src
2025
+1
.gitignore
···
*.png
*.gif
*.qoi
+
*.txt
+30 -2
2015/20/rust/src/main.rs
···
fn main() {
-
let input = include_str!("../../input.txt").trim();
+
let input: u64 = include_str!("../../input.txt")
+
.trim()
+
.parse()
+
.expect("bad input");
+
let input = input / 10;
-
println!("{}", &input);
+
let mut highest_house = (0, 0);
+
let mut house: u64 = 1;
+
// while highest_house.1 < input {
+
while house < 10 {
+
let presents = if house % 2 == 0 {
+
(1..house + 1).fold(0, |acc, elf| {
+
if house % elf == 0 { acc + elf } else { acc }
+
})
+
} else {
+
(1..house.div_ceil(2) + 1).fold(0, |acc, elf| {
+
if house % (elf * 2) == 0 {
+
acc + elf
+
} else {
+
acc
+
}
+
})
+
};
+
if presents > highest_house.1 {
+
highest_house = (house, presents);
+
}
+
house += 1;
+
println!("{} {}", house, presents);
+
}
+
+
println!("Part 1: {:?}", highest_house);
}
+20
2025/5/gleam/gleam.toml
···
+
name = "main"
+
version = "1.0.0"
+
+
# Fill out these fields if you intend to generate HTML documentation or publish
+
# your project to the Hex package manager.
+
#
+
# description = ""
+
# licences = ["Apache-2.0"]
+
# repository = { type = "github", user = "", repo = "" }
+
# links = [{ title = "Website", href = "" }]
+
#
+
# For a full reference of all the available options, you can have a look at
+
# https://gleam.run/writing-gleam/gleam-toml/.
+
+
[dependencies]
+
gleam_stdlib = ">= 0.44.0 and < 2.0.0"
+
simplifile = ">= 2.3.0 and < 3.0.0"
+
+
[dev-dependencies]
+
gleeunit = ">= 1.0.0 and < 2.0.0"
+14
2025/5/gleam/manifest.toml
···
+
# This file was generated by Gleam
+
# You typically do not need to edit this file
+
+
packages = [
+
{ name = "filepath", version = "1.1.2", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "filepath", source = "hex", outer_checksum = "B06A9AF0BF10E51401D64B98E4B627F1D2E48C154967DA7AF4D0914780A6D40A" },
+
{ name = "gleam_stdlib", version = "0.65.0", build_tools = ["gleam"], requirements = [], otp_app = "gleam_stdlib", source = "hex", outer_checksum = "7C69C71D8C493AE11A5184828A77110EB05A7786EBF8B25B36A72F879C3EE107" },
+
{ name = "gleeunit", version = "1.7.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "gleeunit", source = "hex", outer_checksum = "CD701726CBCE5588B375D157B4391CFD0F2F134CD12D9B6998A395484DE05C58" },
+
{ name = "simplifile", version = "2.3.0", build_tools = ["gleam"], requirements = ["filepath", "gleam_stdlib"], otp_app = "simplifile", source = "hex", outer_checksum = "0A868DAC6063D9E983477981839810DC2E553285AB4588B87E3E9C96A7FB4CB4" },
+
]
+
+
[requirements]
+
gleam_stdlib = { version = ">= 0.44.0 and < 2.0.0" }
+
gleeunit = { version = ">= 1.0.0 and < 2.0.0" }
+
simplifile = { version = ">= 2.3.0 and < 3.0.0" }
+117
2025/5/gleam/src/main.gleam
···
+
import gleam/int
+
import gleam/io
+
import gleam/list
+
import gleam/order.{Eq, Gt, Lt}
+
import gleam/set
+
import gleam/string
+
import simplifile as file
+
+
pub fn main() {
+
let assert Ok(input) = file.read(from: "../input.txt")
+
as "Input file not found"
+
let assert [fresh_ranges, available] =
+
input |> string.trim |> string.split("\n\n")
+
let fresh_ranges =
+
fresh_ranges
+
|> string.trim
+
|> string.split("\n")
+
|> list.reverse
+
|> list.drop(5)
+
|> list.take(12)
+
|> list.reverse
+
|> list.map(fn(i) {
+
let assert [from, to] = i |> string.trim |> string.split("-")
+
let assert Ok(from) = int.parse(from)
+
let assert Ok(to) = int.parse(to)
+
#(from / 100_000_000, to / 100_000_000)
+
// #(from, to)
+
})
+
let available =
+
available
+
|> string.split("\n")
+
|> list.map(fn(i) {
+
let assert Ok(id) = int.parse(i)
+
id
+
})
+
+
available
+
|> list.fold(0, fn(acc, i) {
+
acc
+
+ case list.any(fresh_ranges, fn(range) { i >= range.0 && i <= range.1 }) {
+
True -> 1
+
False -> 0
+
}
+
})
+
|> int.to_string
+
|> io.println
+
+
// let haha =
+
// fresh_ranges
+
// |> list.fold(set.new(), fn(acc, i) {
+
// list.range(i.0, i.1) |> list.fold(acc, fn(acc, i) { set.insert(acc, i) })
+
// })
+
// io.println(set.size(haha) |> int.to_string)
+
+
let base_set: set.Set(#(Int, Int)) = set.new()
+
let ranges =
+
fresh_ranges
+
|> list.fold(base_set, fn(prev_seen_ranges, range) {
+
let #(range, seen_ranges) =
+
prev_seen_ranges
+
|> set.fold(#(range, prev_seen_ranges), fn(acc, seen_range) {
+
let #(range, seen_ranges) = acc
+
echo #(
+
range,
+
seen_range,
+
int.compare(range.0, seen_range.0),
+
int.compare(range.1, seen_range.1),
+
int.compare(range.0, seen_range.1),
+
int.compare(range.1, seen_range.0),
+
)
+
case
+
int.compare(range.0, seen_range.0),
+
int.compare(range.1, seen_range.1),
+
int.compare(range.0, seen_range.1),
+
int.compare(range.1, seen_range.0)
+
{
+
Gt, Gt, Gt, Gt | Lt, Lt, Lt, Lt -> #(range, seen_ranges)
+
Eq, Eq, Eq, Eq
+
| Gt, Lt, Lt, Gt
+
| Eq, Lt, Lt, Gt
+
| Eq, Lt, Lt, Eq
+
| Gt, Eq, Lt, Gt
+
| Gt, Eq, Eq, Gt
+
| Eq, Eq, Lt, Gt
+
-> #(#(0, 0), seen_ranges)
+
Eq, Gt, Eq, Gt | Lt, Eq, Lt, Gt | Lt, Gt, Lt, Gt | Lt, Eq, Lt, Eq -> #(
+
range,
+
set.delete(seen_ranges, seen_range),
+
)
+
Eq, Gt, Lt, Gt -> #(range, set.delete(seen_ranges, seen_range))
+
Lt, Lt, Lt, Gt | Lt, Lt, Lt, Eq -> #(
+
#(range.0, seen_range.1),
+
set.delete(seen_ranges, seen_range),
+
)
+
Gt, Gt, Lt, Gt -> #(
+
#(seen_range.0, range.1),
+
set.delete(seen_ranges, seen_range),
+
)
+
Gt, Gt, Eq, Gt -> #(
+
#(seen_range.0, range.0),
+
set.delete(seen_ranges, seen_range),
+
)
+
_, _, _, _ -> #(range, seen_ranges)
+
}
+
})
+
+
case range == #(0, 0) {
+
False -> seen_ranges |> set.insert(range)
+
True -> seen_ranges
+
}
+
})
+
echo ranges
+
ranges
+
|> set.fold(0, fn(acc, range) { acc + range.1 - range.0 + 1 })
+
|> int.to_string
+
|> io.println
+
}