{"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":"526a5339-143e-5e60-8435-98841c6a56e9","task_key":"test--526a5339-143e-5e60-8435-98841c6a56e9","task_revision_id":"1","upstream_id":"","short_description":"An $ (n, k) \\minus{}$ tournament is a contest with $ n$ players held in $ k$…","config":"","split":"test","body":"{\"problem\":\"An $ (n, k) \\\\minus{}$ tournament is a contest with $ n$ players held in $ k$ rounds such that:\\n\\n$ (i)$ Each player plays in each round, and every two players meet at most once.\\n$ (ii)$ If player $ A$ meets player $ B$ in round $ i$, player $ C$ meets player $ D$ in round $ i$, and player $ A$ meets player $ C$ in round $ j$, then player $ B$ meets player $ D$ in round $ j$.\\n\\nDetermine all pairs $ (n, k)$ for which there exists an $ (n, k) \\\\minus{}$ tournament.\\n\\n[i]\"}","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":[]}