{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"418a1990-f14e-58d3-8ae6-4c6287cd6d92","task_key":"test--418a1990-f14e-58d3-8ae6-4c6287cd6d92","task_revision_id":"3","upstream_id":"","short_description":"A table tennis club hosts a series of doubles matches following several rules:","config":"","split":"test","body":"{\"problem\":\"A table tennis club hosts a series of doubles matches following several rules:\\n(i)  each player belongs to two pairs at most;\\n(ii) every two distinct pairs play one game against each other at most;\\n(iii) players in the same pair do not play against each other when they pair with others respectively.\\nEvery player plays a certain number of games in this series. All these distinct numbers make up a set called the “[i]set of games[/i]”. Consider a set $A=\\\\{a_1,a_2,\\\\ldots ,a_k\\\\}$ of positive integers such that every element in $A$ is divisible by $6$. Determine the minimum number of players needed to participate in this series so that a schedule for which the corresponding [i]set of games [/i] is equal to set $A$ exists.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}