theoludwig/advent_of_code
1
1
Fork 0
mirror of https://github.com/theoludwig/advent_of_code.git synced 2025-05-18 19:27:51 +02:00
Code Issues Releases Activity

test: add cases for input.txt

Browse Source
This commit is contained in:
Théo LUDWIG
2023-12-08 18:56:07 +01:00
parent 97c302d9e1
commit 755e211f3f
10 changed files with 61 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
day_4/README.md
View File

@ -41,12 +41,6 @@ So, in this example, the Elf's pile of scratchcards is worth **`13`** points.
Take a seat in the large pile of colorful cards. **How many points are they worth in total?**
To begin, [get your puzzle input](./input.txt).
Your puzzle answer was `24160`.
**The first half of this puzzle is complete! It provides one gold star: `*`.**
## Instructions - Part 2
Just as you're about to report your findings to the Elf, one of you realizes that the rules have actually been printed on the back of every card this whole time.
@ -79,7 +73,3 @@ Card 6: 31 18 13 56 72 | 74 77 10 23 35 67 36 11
Once all of the originals and copies have been processed, you end up with 1 instance of card 1, **`2`** instances of card 2, **`4`** instances of card 3, **`8`** instances of card 4, **`14`** instances of card 5, and **`1`** instance of card 6. In total, this example pile of scratchcards causes you to ultimately have **`30`** scratchcards!
Process all of the original and copied scratchcards until no more scratchcards are won. Including the original set of scratchcards, **how many total scratchcards do you end up with**?
Your puzzle answer was `5659035`.
**Both parts of this puzzle are complete! They provide two gold stars: `**`.**

10
day_4/src/lib.rs
View File

@ -160,4 +160,14 @@ mod day_4_tests {
fn test_part_2_example() {
assert_eq!(part_2(include_str!("../input_example_1.txt")), 30);
}
#[test]
fn test_part_1() {
assert_eq!(part_1(include_str!("../input.txt")), 24160);
}
#[test]
fn test_part_2() {
assert_eq!(part_2(include_str!("../input.txt")), 5659035);
}
}