{"status": "success", "data": {"description_md": "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.)<br><center><img class=\"problem-image\" alt='[asy] import olympiad; unitsize(50); for (int i = 0; i &lt; 3; ++i) { for (int j = 0; j &lt; 4; ++j) { pair A = (j,i); dot(A);  } } for (int i = 0; i &lt; 3; ++i) { for (int j = 0; j &lt; 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]' class=\"latexcenter\" height=\"188\" src=\"https://latex.artofproblemsolving.com/2/6/8/268cd67d45f5b55a849d4cc611db555eb4e89633.png\" width=\"295\"/></center><br>How many different routes can Paula take?\n\n$\\textbf{(A) } 0 \\qquad\\textbf{(B) } 1 \\qquad\\textbf{(C) } 2 \\qquad\\textbf{(D) } 3\\qquad\\textbf{(E) } 4$\n___\nFull credit goes to [MAA](https://maa.org/) for authoring these problems. These problems were taken on the [AOPS](https://artofproblemsolving.com/) website.", "description_html": "<p>The figure below is a map showing  <span class=\"katex--inline\">12</span>  cities and  <span class=\"katex--inline\">17</span>  roads connecting certain pairs of cities. Paula wishes to travel along exactly  <span class=\"katex--inline\">13</span>  of those roads, starting at city  <span class=\"katex--inline\">A</span>  and ending at city  <span class=\"katex--inline\">L,</span>  without traveling along any portion of a road more than once. (Paula is allowed to visit a city more than once.)<br/><center><img class=\"latexcenter\" alt=\"[asy] import olympiad; unitsize(50); for (int i = 0; i &lt; 3; ++i) { for (int j = 0; j &lt; 4; ++j) { pair A = (j,i); dot(A);  } } for (int i = 0; i &lt; 3; ++i) { for (int j = 0; j &lt; 4; ++j) { if (j&#160;!= 3) { draw((j,i)--(j+1,i)); } if (i&#160;!= 2) { draw((j,i)--(j,i+1)); } } } label(&#34;$A$&#34;, (0,2), W); label(&#34;$L$&#34;, (3,0), E); [/asy]\" height=\"188\" src=\"https://latex.artofproblemsolving.com/2/6/8/268cd67d45f5b55a849d4cc611db555eb4e89633.png\" width=\"295\"/></center><br/>How many different routes can Paula take?</p>&#10;<p> <span class=\"katex--inline\">\\textbf{(A) } 0 \\qquad\\textbf{(B) } 1 \\qquad\\textbf{(C) } 2 \\qquad\\textbf{(D) } 3\\qquad\\textbf{(E) } 4</span> </p>&#10;<hr><p>Full credit goes to <a href=\"https://maa.org/\">MAA</a> for authoring these problems. These problems were taken on the <a href=\"https://artofproblemsolving.com/\">AOPS</a> website.</p>", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 2, "problem_name": "2019 AMC 12B Problem 10", "can_next": true, "can_prev": true, "nxt": "/problem/19_amc12B_p11", "prev": "/problem/19_amc12B_p09"}}