{"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":"f54077d5-fa45-5ebc-965b-a135696b5a52","task_key":"test--f54077d5-fa45-5ebc-965b-a135696b5a52","task_revision_id":"1","upstream_id":"","short_description":"The classrooms at MIT are each identified with a positive integer (with no…","config":"","split":"test","body":"{\"problem\":\"The classrooms at MIT are each identified with a positive integer (with no leading zeroes). One day, as President Reif walks down the Infinite Corridor, he notices that a digit zero on a room sign has fallen off. Let $N$ be the original number of the room, and let $M$ be the room number as shown on the sign. The smallest interval containing all possible values of $\\\\frac{M}{N}$ can be expressed as $\\\\left[\\\\frac{a}{b}, \\\\frac{c}{d}\\\\right)$ where $a, b, c, d$ are positive integers with $\\\\operatorname{gcd}(a, b)=\\\\operatorname{gcd}(c, d)=1$. Compute $1000 a+100 b+10 c+d$.\"}","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":[]}