{"status": "success", "data": {"description_md": "**Full credit goes to the staff team at Canada Math for authoring these problems.**\n\nIn Wordland, every library has $10$ shelves. Each shelf has some number of books, all with different names, in random order. Two libraries are considered different if there is some shelf with a different number of books. A shelf is called \u201cnear-sorted\u201d if one of the following conditions is satisfied:\n\n   1. The shelf is empty.\n   2. All the books on the shelf are sorted in alphabetical order except for the book that comes first in alphabetical order, which must not come first in the arrangement.\n\nFor example, in a shelf with books $A, B, C$ and $D$, the arrangements $BACD$ and $BCDA$ would be near-sorted, but the arrangements $ABCD$ and $ABDC$ would not. A library is called \u201cnear-perfect\u201d if all of its shelves are near-sorted. Find the sum of the probabilities over all possible libraries that the library is near-perfect. ", "description_html": "<p><strong>Full credit goes to the staff team at Canada Math for authoring these problems.</strong></p>&#10;<p>In Wordland, every library has <span class=\"katex--inline\">10</span> shelves. Each shelf has some number of books, all with different names, in random order. Two libraries are considered different if there is some shelf with a different number of books. A shelf is called &#8220;near-sorted&#8221; if one of the following conditions is satisfied:</p>&#10;<ol>&#10;<li>The shelf is empty.</li>&#10;<li>All the books on the shelf are sorted in alphabetical order except for the book that comes first in alphabetical order, which must not come first in the arrangement.</li>&#10;</ol>&#10;<p>For example, in a shelf with books <span class=\"katex--inline\">A, B, C</span> and <span class=\"katex--inline\">D</span>, the arrangements <span class=\"katex--inline\">BACD</span> and <span class=\"katex--inline\">BCDA</span> would be near-sorted, but the arrangements <span class=\"katex--inline\">ABCD</span> and <span class=\"katex--inline\">ABDC</span> would not. A library is called &#8220;near-perfect&#8221; if all of its shelves are near-sorted. Find the sum of the probabilities over all possible libraries that the library is near-perfect.</p>&#10;", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 5, "problem_name": "Canada Math Contest #2 - Problem 11", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}