From 0a95c9c9642869bcaf5420f4f8038d5b97d88258 Mon Sep 17 00:00:00 2001 From: rain Date: Tue, 5 Dec 2023 19:32:53 -0600 Subject: [PATCH] Completed python for day 2 --- 2023/day02/README.md | 34 +++++++++++++++++++++++++++++++++ 2023/day02/solutions/python1.py | 29 ++++++++++++++++++++++++++++ 2023/day02/solutions/python2.py | 27 ++++++++++++++++++++++++++ 3 files changed, 90 insertions(+) create mode 100644 2023/day02/solutions/python1.py create mode 100644 2023/day02/solutions/python2.py diff --git a/2023/day02/README.md b/2023/day02/README.md index 22254d5..99c3ebf 100644 --- a/2023/day02/README.md +++ b/2023/day02/README.md @@ -41,4 +41,38 @@ In the example above, games 1, 2, and 5 would have been *possible* if the bag ha Determine which games would have been possible if the bag had been loaded with only 12 red cubes, 13 green cubes, and 14 blue cubes. *What is the sum of the IDs of those games?* +, --- Part Two --- +---------------- + +The Elf says they've stopped producing snow because they aren't getting any *water*! He isn't sure why the water stopped; however, he can show you how to get to the water source to check it out for yourself. It's just up ahead! + + +As you continue your walk, the Elf poses a second question: in each game you played, what is the *fewest number of cubes of each color* that could have been in the bag to make the game possible? + + +Again consider the example games from earlier: + + + +``` +Game 1: 3 blue, 4 red; 1 red, 2 green, 6 blue; 2 green +Game 2: 1 blue, 2 green; 3 green, 4 blue, 1 red; 1 green, 1 blue +Game 3: 8 green, 6 blue, 20 red; 5 blue, 4 red, 13 green; 5 green, 1 red +Game 4: 1 green, 3 red, 6 blue; 3 green, 6 red; 3 green, 15 blue, 14 red +Game 5: 6 red, 1 blue, 3 green; 2 blue, 1 red, 2 green + +``` + +* In game 1, the game could have been played with as few as 4 red, 2 green, and 6 blue cubes. If any color had even one fewer cube, the game would have been impossible. +* Game 2 could have been played with a minimum of 1 red, 3 green, and 4 blue cubes.* * Game 3 must have been played with at least 20 red, 13 green, and 6 blue cubes. +* Game 4 required at least 14 red, 3 green, and 15 blue cubes. +* Game 5 needed no fewer than 6 red, 3 green, and 2 blue cubes in the bag. + + +The *power* of a set of cubes is equal to the numbers of red, green, and blue cubes multiplied together. The power of the minimum set of cubes in game 1 is `48`. In games 2-5 it was `12`, `1560`, `630`, and `36`, respectively. Adding up these five powers produces the sum `*2286*`. + + +For each game, find the minimum set of cubes that must have been present. *What is the sum of the power of these sets?* + + ] \ No newline at end of file diff --git a/2023/day02/solutions/python1.py b/2023/day02/solutions/python1.py new file mode 100644 index 0000000..c786972 --- /dev/null +++ b/2023/day02/solutions/python1.py @@ -0,0 +1,29 @@ +with open("../input.txt", "r") as fp: + inputs = fp.readlines() + +limit = { + "red": 12, + "green": 13, + "blue": 14 +} + +sum = 0 +for line in inputs: + id = int(line.split(':')[0].split(' ')[-1]) + game = line.split(':')[-1] + rounds = game.split(';') + + impossible = False + for round in rounds: + blocks = round.split(",") + for block in blocks: + num = int(block.strip().split(' ')[0]) + color = block.strip().split(' ')[-1] + if num > limit.get(color): + impossible = True + break + + if not impossible: + sum += id + +print(sum) \ No newline at end of file diff --git a/2023/day02/solutions/python2.py b/2023/day02/solutions/python2.py new file mode 100644 index 0000000..c8c2409 --- /dev/null +++ b/2023/day02/solutions/python2.py @@ -0,0 +1,27 @@ +with open("../input.txt", "r") as fp: + inputs = fp.readlines() + +sum = 0 +for line in inputs: + id = int(line.split(':')[0].split(' ')[-1]) + game = line.split(':')[-1] + rounds = game.split(';') + + rgb = { + "red": 0, + "green": 0, + "blue": 0 + } + + for round in rounds: + blocks = round.split(",") + for block in blocks: + num = int(block.strip().split(' ')[0]) + color = block.strip().split(' ')[-1] + + if num > rgb.get(color): + rgb[color] = num; + + sum += (rgb["red"] * rgb["green"] * rgb["blue"]) + +print(sum) \ No newline at end of file