{"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":"ac8527ac-9e86-54c6-b7a0-99bbec8fd1a2","task_key":"test--ac8527ac-9e86-54c6-b7a0-99bbec8fd1a2","task_revision_id":"1","upstream_id":"","short_description":"A nonempty set $S$ is called well-filled if for every $m \\in S$, there are fewer…","config":"","split":"test","body":"{\"problem\":\"A nonempty set $S$ is called well-filled if for every $m \\\\in S$, there are fewer than $\\\\frac{1}{2}m$ elements of $S$ which are less than $m$. Determine the number of well-filled subsets of $\\\\{1,2, \\\\ldots, 42\\\\}$.\"}","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":[]}