{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"98c2cb27-9783-5ba1-88aa-3b7f2a787ba1","task_key":"test--98c2cb27-9783-5ba1-88aa-3b7f2a787ba1","task_revision_id":"1","upstream_id":"","short_description":"James is standing at the point $(0,1)$ on the coordinate plane and wants to eat…","config":"","split":"test","body":"{\"problem\":\"James is standing at the point $(0,1)$ on the coordinate plane and wants to eat a hamburger. For each integer $n \\\\geq 0$, the point $(n, 0)$ has a hamburger with $n$ patties. There is also a wall at $y=2.1$ which James cannot cross. In each move, James can go either up, right, or down 1 unit as long as he does not cross the wall or visit a point he has already visited. Every second, James chooses a valid move uniformly at random, until he reaches a point with a hamburger. Then he eats the hamburger and stops moving. Find the expected number of patties that James eats on his burger.\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}