{"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":"d7a51d9b-b329-5a3c-bdb2-35bd70ede549","task_key":"test--d7a51d9b-b329-5a3c-bdb2-35bd70ede549","task_revision_id":"1","upstream_id":"","short_description":"Let $X$ be the collection of all functions $f:\\{0,1, \\ldots, 2016\\}…","config":"","split":"test","body":"{\"problem\":\"Let $X$ be the collection of all functions $f:\\\\{0,1, \\\\ldots, 2016\\\\} \\\\rightarrow\\\\{0,1, \\\\ldots, 2016\\\\}$. Compute the number of functions $f \\\\in X$ such that $$\\\\max _{g \\\\in X}\\\\left(\\\\min _{0 \\\\leq i \\\\leq 2016}(\\\\max (f(i), g(i)))-\\\\max _{0 \\\\leq i \\\\leq 2016}(\\\\min (f(i), g(i)))\\\\right)=2015$$\"}","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":[]}