{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"7980c3cb-2904-5811-8b86-2b4255bc7815","task_key":"test--7980c3cb-2904-5811-8b86-2b4255bc7815","task_revision_id":"3","upstream_id":"","short_description":"Let $a_1,a_2,a_3,\\cdots$ be a non-decreasing sequence of positive integers. For…","config":"","split":"test","body":"{\"problem\":\"Let $a_1,a_2,a_3,\\\\cdots$ be a non-decreasing sequence of positive integers. For $m\\\\ge1$ , define $b_m=\\\\min\\\\{n: a_n \\\\ge m\\\\}$ , that is, $b_m$ is the minimum value of $n$ such that $a_n\\\\ge m$ . If $a_{19}=85$ , determine the maximum value of $a_1+a_2+\\\\cdots+a_{19}+b_1+b_2+\\\\cdots+b_{85}$ .\"}","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":[]}