Compare commits
2 commits
016a92f3cd
...
4dcc750416
Author | SHA1 | Date | |
---|---|---|---|
4dcc750416 | |||
2194015259 |
3 changed files with 60 additions and 20 deletions
2
.gitignore
vendored
Normal file
2
.gitignore
vendored
Normal file
|
@ -0,0 +1,2 @@
|
||||||
|
*.in
|
||||||
|
*.ex*
|
35
day02.py
Normal file
35
day02.py
Normal file
|
@ -0,0 +1,35 @@
|
||||||
|
import fileinput
|
||||||
|
from functools import reduce
|
||||||
|
|
||||||
|
def main():
|
||||||
|
part1 = 0
|
||||||
|
part2 = 0
|
||||||
|
|
||||||
|
for i, line in enumerate(fileinput.input()):
|
||||||
|
line = line.strip()
|
||||||
|
subsets = line.split(": ")[1].split("; ")
|
||||||
|
|
||||||
|
maxes = {}
|
||||||
|
|
||||||
|
part1_possible = True
|
||||||
|
for subset in subsets:
|
||||||
|
for balls in subset.split(", "):
|
||||||
|
count, color = balls.split()
|
||||||
|
count = int(count)
|
||||||
|
maxes[color] = max(maxes.get(color, 0), count)
|
||||||
|
part1_possible = (
|
||||||
|
part1_possible
|
||||||
|
and (color != "red" or count <= 12)
|
||||||
|
and (color != "green" or count <= 13)
|
||||||
|
and (color != "blue" or count <= 14)
|
||||||
|
)
|
||||||
|
|
||||||
|
if part1_possible:
|
||||||
|
part1 += i + 1
|
||||||
|
|
||||||
|
power = reduce(lambda x, y: x * y, maxes.values())
|
||||||
|
part2 += power
|
||||||
|
|
||||||
|
print(part1, part2)
|
||||||
|
|
||||||
|
main()
|
43
day04.py
43
day04.py
|
@ -1,24 +1,27 @@
|
||||||
import fileinput
|
import fileinput
|
||||||
|
|
||||||
#
|
def main():
|
||||||
# Part 1
|
#
|
||||||
#
|
# Part 1
|
||||||
cards = []
|
#
|
||||||
part1 = 0
|
cards = []
|
||||||
for i, line in enumerate(fileinput.input()):
|
part1 = 0
|
||||||
card = line.rstrip().split(": ")[1]
|
for line in fileinput.input():
|
||||||
(winning, owned) = ({int(i) for i in h.split()} for h in card.split(" | "))
|
card = line.split(": ", 1)[1]
|
||||||
count = len(winning & owned)
|
(winning, owned) = ({int(i) for i in h.split()} for h in card.split(" | ", 1))
|
||||||
cards.append(count)
|
count = len(winning & owned)
|
||||||
part1 += 1 << count - 1 if count else 0
|
cards.append(count)
|
||||||
|
part1 += 1 << count - 1 if count else 0
|
||||||
|
|
||||||
#
|
#
|
||||||
# Part 2
|
# Part 2
|
||||||
#
|
#
|
||||||
dp = [0] * len(cards)
|
dp = [0] * len(cards)
|
||||||
part2 = 0
|
part2 = 0
|
||||||
for i in range(len(cards)):
|
for i in range(len(cards)):
|
||||||
dp[i] = 1 + sum(dp[i - cards[-i - 1] : i])
|
dp[i] = 1 + sum(dp[i - cards[-i - 1] : i])
|
||||||
part2 += dp[i]
|
part2 += dp[i]
|
||||||
|
|
||||||
print(part1, part2)
|
print(part1, part2)
|
||||||
|
|
||||||
|
main()
|
||||||
|
|
Loading…
Reference in a new issue