Problem

2019 AMC 12B Problem 10

The figure below is a map showing 12 cities and 17 roads connecting certain pairs of cities. Paula wishes to travel along exactly 13 of those roads, starting at city A and ending at city L, without traveling along any portion of a road more than once. (Paula is allowed to visit a city more than once.)

[asy] import olympiad; unitsize(50); for (int i = 0; i < 3; ++i) { for (int j = 0; j < 4; ++j) { pair A = (j,i); dot(A); } } for (int i = 0; i < 3; ++i) { for (int j = 0; j < 4; ++j) { if (j != 3) { draw((j,i)--(j+1,i)); } if (i != 2) { draw((j,i)--(j,i+1)); } } } label("$A$", (0,2), W); label("$L$", (3,0), E); [/asy]

How many different routes can Paula take?

\textbf{(A) } 0 \qquad\textbf{(B) } 1 \qquad\textbf{(C) } 2 \qquad\textbf{(D) } 3\qquad\textbf{(E) } 4

Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.


Show/Hide Problem Tags

Problem Tags: Counting and probability
Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Go to previous contest problem (SHIFT + Left Arrow) Go to next contest problem (SHIFT + Right Arrow)
Category: AMC 12B
Points: 1
Back to practice
Train more like this