{"status": "success", "data": {"description_md": "Toshiro must convince a girl that he is orz at math. To do this, he must split five distinct people into groups of size two or more (having one group is allowable). Three of these people are Toshiro's friends and will say that Toshiro is orz. The other two hate Toshiro and will say that he is *norz* (not orz). Toshiro needs to split the people so that, in **EVERY** group, the people who say Toshiro is orz is greater than or equal to the people who say he is norz. In other words, if there are $n$ people in a group, the people who say Toshiro is orz in that group should be $m \\geq \\left\\lceil{\\frac{n}{2}}\\right\\rceil$. How many ways can Toshiro achieve this?", "description_html": "<p>Toshiro must convince a girl that he is orz at math. To do this, he must split five distinct people into groups of size two or more (having one group is allowable). Three of these people are Toshiro&#8217;s friends and will say that Toshiro is orz. The other two hate Toshiro and will say that he is <em>norz</em> (not orz). Toshiro needs to split the people so that, in <strong>EVERY</strong> group, the people who say Toshiro is orz is greater than or equal to the people who say he is norz. In other words, if there are <span class=\"katex--inline\">n</span> people in a group, the people who say Toshiro is orz in that group should be <span class=\"katex--inline\">m \\geq \\left\\lceil{\\frac{n}{2}}\\right\\rceil</span>. How many ways can Toshiro achieve this?</p>&#10;", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 2, "problem_name": "Holiday Contest 2025 - Team Round - Problem 6", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}