Adding some problems
This commit is contained in:
150
2024/day23/problem
Normal file
150
2024/day23/problem
Normal file
@@ -0,0 +1,150 @@
|
||||
[1]Advent of Code
|
||||
|
||||
--- Day 23: LAN Party ---
|
||||
|
||||
As The Historians wander around a secure area at Easter Bunny HQ, you come
|
||||
across posters for a [16]LAN party scheduled for today! Maybe you can find
|
||||
it; you connect to a nearby [17]datalink port and download a map of the
|
||||
local network (your puzzle input).
|
||||
|
||||
The network map provides a list of every connection between two computers.
|
||||
For example:
|
||||
|
||||
kh-tc
|
||||
qp-kh
|
||||
de-cg
|
||||
ka-co
|
||||
yn-aq
|
||||
qp-ub
|
||||
cg-tb
|
||||
vc-aq
|
||||
tb-ka
|
||||
wh-tc
|
||||
yn-cg
|
||||
kh-ub
|
||||
ta-co
|
||||
de-co
|
||||
tc-td
|
||||
tb-wq
|
||||
wh-td
|
||||
ta-ka
|
||||
td-qp
|
||||
aq-cg
|
||||
wq-ub
|
||||
ub-vc
|
||||
de-ta
|
||||
wq-aq
|
||||
wq-vc
|
||||
wh-yn
|
||||
ka-de
|
||||
kh-ta
|
||||
co-tc
|
||||
wh-qp
|
||||
tb-vc
|
||||
td-yn
|
||||
|
||||
Each line of text in the network map represents a single connection; the
|
||||
line kh-tc represents a connection between the computer named kh and the
|
||||
computer named tc. Connections aren't directional; tc-kh would mean
|
||||
exactly the same thing.
|
||||
|
||||
LAN parties typically involve multiplayer games, so maybe you can locate
|
||||
it by finding groups of connected computers. Start by looking for sets of
|
||||
three computers where each computer in the set is connected to the other
|
||||
two computers.
|
||||
|
||||
In this example, there are 12 such sets of three inter-connected
|
||||
computers:
|
||||
|
||||
aq,cg,yn
|
||||
aq,vc,wq
|
||||
co,de,ka
|
||||
co,de,ta
|
||||
co,ka,ta
|
||||
de,ka,ta
|
||||
kh,qp,ub
|
||||
qp,td,wh
|
||||
tb,vc,wq
|
||||
tc,td,wh
|
||||
td,wh,yn
|
||||
ub,vc,wq
|
||||
|
||||
If the Chief Historian is here, and he's at the LAN party, it would be
|
||||
best to know that right away. You're pretty sure his computer's name
|
||||
starts with t, so consider only sets of three computers where at least one
|
||||
computer's name starts with t. That narrows the list down to 7 sets of
|
||||
three inter-connected computers:
|
||||
|
||||
co,de,ta
|
||||
co,ka,ta
|
||||
de,ka,ta
|
||||
qp,td,wh
|
||||
tb,vc,wq
|
||||
tc,td,wh
|
||||
td,wh,yn
|
||||
|
||||
Find all the sets of three inter-connected computers. How many contain at
|
||||
least one computer with a name that starts with t?
|
||||
|
||||
Your puzzle answer was 1485.
|
||||
|
||||
--- Part Two ---
|
||||
|
||||
There are still way too many results to go through them all. You'll have
|
||||
to find the LAN party another way and go there yourself.
|
||||
|
||||
Since it doesn't seem like any employees are around, you figure they must
|
||||
all be at the LAN party. If that's true, the LAN party will be the largest
|
||||
set of computers that are all connected to each other. That is, for each
|
||||
computer at the LAN party, that computer will have a connection to every
|
||||
other computer at the LAN party.
|
||||
|
||||
In the above example, the largest set of computers that are all connected
|
||||
to each other is made up of co, de, ka, and ta. Each computer in this set
|
||||
has a connection to every other computer in the set:
|
||||
|
||||
ka-co
|
||||
ta-co
|
||||
de-co
|
||||
ta-ka
|
||||
de-ta
|
||||
ka-de
|
||||
|
||||
The LAN party posters say that the password to get into the LAN party is
|
||||
the name of every computer at the LAN party, sorted alphabetically, then
|
||||
joined together with commas. (The people running the LAN party are clearly
|
||||
a bunch of nerds.) In this example, the password would be co,de,ka,ta.
|
||||
|
||||
What is the password to get into the LAN party?
|
||||
|
||||
Your puzzle answer was cc,dz,ea,hj,if,it,kf,qo,sk,ug,ut,uv,wh.
|
||||
|
||||
Both parts of this puzzle are complete! They provide two gold stars: **
|
||||
|
||||
At this point, you should [18]return to your Advent calendar and try
|
||||
another puzzle.
|
||||
|
||||
If you still want to see it, you can [19]get your puzzle input.
|
||||
|
||||
References
|
||||
|
||||
Visible links
|
||||
1. https://adventofcode.com/
|
||||
2. https://adventofcode.com/2024/about
|
||||
3. https://adventofcode.com/2024/events
|
||||
4. https://cottonbureau.com/people/advent-of-code
|
||||
5. https://adventofcode.com/2024/settings
|
||||
6. https://adventofcode.com/2024/auth/logout
|
||||
7. Advent of Code Supporter
|
||||
https://adventofcode.com/2024/support
|
||||
8. https://adventofcode.com/2024
|
||||
9. https://adventofcode.com/2024
|
||||
10. https://adventofcode.com/2024/support
|
||||
11. https://adventofcode.com/2024/sponsors
|
||||
12. https://adventofcode.com/2024/leaderboard
|
||||
13. https://adventofcode.com/2024/stats
|
||||
14. https://adventofcode.com/2024/sponsors
|
||||
16. https://en.wikipedia.org/wiki/LAN_party
|
||||
17. https://adventofcode.com/2016/day/9
|
||||
18. https://adventofcode.com/2024
|
||||
19. https://adventofcode.com/2024/day/23/input
|
Reference in New Issue
Block a user