Skip to main content
OlympiadHQ

Browse · harp

Print

jmc

prealgebra junior

Problem

The one-way routes connecting towns and are shown in the figure below(not drawn to scale).The distances in kilometers along each route are marked. Traveling along these routes, what is the shortest distance from A to Z in kilometers?
(A)
(B)
(C)
(D)
Solution
We can simply see that path will give us the smallest value. Adding, . This is nice as it's also the smallest value, solidifying our answer. You can also simply brute-force it or sort of think ahead - for example, getting from A to M can be done ways; () or , so you should take the shorter route (). Another example is M to C, two ways - one is and the other is . Take the shorter route. After this, you need to consider a few more times - consider if () is greater than ), which it is not, and consider if ) is greater than () or () which it is not. TLDR: . [Note: This is probably just the thinking behind the solution.] {Double-note: As MaxyMoosy said, since this answer is the smallest one, it has to be the right answer.}
Final answer
A