{"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":"f758e099-0bd6-5ad9-8064-77d9d3dcdc1f","task_key":"test--f758e099-0bd6-5ad9-8064-77d9d3dcdc1f","task_revision_id":"1","upstream_id":"","short_description":"For each interger $n\\geq 4$, we consider the $m$ subsets $A_1, A_2,\\dots, A_m$…","config":"","split":"test","body":"{\"problem\":\"For each interger $n\\\\geq 4$, we consider the $m$ subsets $A_1, A_2,\\\\dots, A_m$ of $\\\\{1, 2, 3,\\\\dots, n\\\\}$, such that\\n$A_1$ has exactly one element, $A_2$ has exactly two elements,...., $A_m$ has exactly $m$ elements and none of these subsets is contained in any other set. Find the maximum value of $m$.\"}","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":[]}