{"status": "success", "data": {"description_md": "Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$. From any vertex of the heptagon except $E$, the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$.\n___\nLeading zeroes must be inputted, so if your answer is `34`, then input `034`. Full 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>Let <span class=\"katex--inline\">SP_1P_2P_3EP_4P_5</span> be a heptagon. A frog starts jumping at vertex <span class=\"katex--inline\">S</span>. From any vertex of the heptagon except <span class=\"katex--inline\">E</span>, the frog may jump to either of the two adjacent vertices. When it reaches vertex <span class=\"katex--inline\">E</span>, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than <span class=\"katex--inline\">12</span> jumps that end at <span class=\"katex--inline\">E</span>.</p>&#10;<hr><p>Leading zeroes must be inputted, so if your answer is <code>34</code>, then input <code>034</code>. 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": 6, "problem_name": "2018 AIME I Problem 14", "can_next": true, "can_prev": true, "nxt": "/problem/18_aime_I_p15", "prev": "/problem/18_aime_I_p13"}}