{"status": "success", "data": {"description_md": "A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in $2007$. No character may appear in a sequence more times than it appears among the four letters in AIME or the four digits in $2007$. A set of plates in which each possible sequence appears exactly once contains $N$ license plates. Find $\\frac{N}{10}$.\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>A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in <span class=\"katex--inline\">2007</span>. No character may appear in a sequence more times than it appears among the four letters in AIME or the four digits in <span class=\"katex--inline\">2007</span>. A set of plates in which each possible sequence appears exactly once contains <span class=\"katex--inline\">N</span> license plates. Find <span class=\"katex--inline\">\\frac{N}{10}</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": 3, "problem_name": "2007 AIME II Problem 1", "can_next": true, "can_prev": false, "nxt": "/problem/07_aime_II_p02", "prev": ""}}