{"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":"e2a789d1-26ad-54d8-a378-c805054e6426","task_key":"test--e2a789d1-26ad-54d8-a378-c805054e6426","task_revision_id":"1","upstream_id":"","short_description":"How many nondecreasing sequences $a_{1}, a_{2}, \\ldots, a_{10}$ are composed…","config":"","split":"test","body":"{\"problem\":\"How many nondecreasing sequences $a_{1}, a_{2}, \\\\ldots, a_{10}$ are composed entirely of at most three distinct numbers from the set $\\\\{1,2, \\\\ldots, 9\\\\}$ (so $1,1,1,2,2,2,3,3,3,3$ and $2,2,2,2,5,5,5,5,5,5$ are both allowed)?\"}","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":[]}