{"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":"43e65bd5-4bdd-5cb4-b455-d5ee2f00b19c","task_key":"test--43e65bd5-4bdd-5cb4-b455-d5ee2f00b19c","task_revision_id":"1","upstream_id":"","short_description":"In the Cartesian plane, let $A=(0,0), B=(200,100)$, and $C=(30,330)$. Compute…","config":"","split":"test","body":"{\"problem\":\"In the Cartesian plane, let $A=(0,0), B=(200,100)$, and $C=(30,330)$. Compute the number of ordered pairs $(x, y)$ of integers so that $\\\\left(x+\\\\frac{1}{2}, y+\\\\frac{1}{2}\\\\right)$ is in the interior of triangle $A 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":[]}