{"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":"00a63d8a-0368-5836-9647-12615900cadf","task_key":"test--00a63d8a-0368-5836-9647-12615900cadf","task_revision_id":"1","upstream_id":"","short_description":"Two unit squares $S_{1}$ and $S_{2}$ have horizontal and vertical sides. Let $x$…","config":"","split":"test","body":"{\"problem\":\"Two unit squares $S_{1}$ and $S_{2}$ have horizontal and vertical sides. Let $x$ be the minimum distance between a point in $S_{1}$ and a point in $S_{2}$, and let $y$ be the maximum distance between a point in $S_{1}$ and a point in $S_{2}$. Given that $x=5$, the difference between the maximum and minimum possible values for $y$ can be written as $a+b \\\\sqrt{c}$, where $a, b$, and $c$ are integers and $c$ is positive and square-free. Find $100 a+10 b+c$.\"}","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":[]}