{"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":"753066bf-513e-5a46-857f-532e71ee5866","task_key":"test--753066bf-513e-5a46-857f-532e71ee5866","task_revision_id":"1","upstream_id":"","short_description":"Given $ n$ countries with three representatives each, $ m$ committees $…","config":"","split":"test","body":"{\"problem\":\"Given $ n$ countries with three representatives each, $ m$ committees $ A(1),A(2), \\\\ldots, A(m)$ are called a cycle if\\n\\n[i](i)[/i] each committee has $ n$ members, one from each country;\\n[i](ii)[/i] no two committees have the same membership;\\n[i](iii)[/i] for $ i \\\\equal{} 1, 2, \\\\ldots,m$, committee $ A(i)$ and committee $ A(i \\\\plus{} 1)$ have no member in common, where $ A(m \\\\plus{} 1)$ denotes $ A(1);$\\n[i](iv)[/i] if $ 1 < |i \\\\minus{} j| < m \\\\minus{} 1,$ then committees $ A(i)$ and $ A(j)$ have at least one member in common.\\n\\nIs it possible to have a cycle of 1990 committees with 11 countries?\"}","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":[]}