{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"数学オリンピック水準の問題を通じて、数学的推論能力を評価するベンチマークです。公式データは4,428問を収録し、分野や難易度の情報を伴います。\n\nOmni-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"},"task_id":"28ddc7bf-2103-5e64-9121-de2dfabf7e0d","task_key":"test--28ddc7bf-2103-5e64-9121-de2dfabf7e0d","task_revision_id":"2","upstream_id":"","short_description":"A social club has $2k+1$ members, each of whom is fluent in the same $k$…","config":"","split":"test","body":"{\"problem\":\"A social club has $2k+1$ members, each of whom is fluent in the same $k$ languages.  Any pair of members always talk to each other in only one language.  Suppose that there were no three members such that they use only one language among them.  Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages.  Find the maximum possible value of $A$.\"}","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":[]}