{"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":"7212e5da-2acf-58c9-b682-73a41b4898b7","task_key":"test--7212e5da-2acf-58c9-b682-73a41b4898b7","task_revision_id":"1","upstream_id":"","short_description":"A $\\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \\ldots,…","config":"","split":"test","body":"{\"problem\":\"A $\\\\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \\\\ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\\\\pm 1$-sequence, there exists an integer $k$ and indices $1 \\\\le t_1 < \\\\ldots < t_k \\\\le 2022$ so that $t_{i+1} - t_i \\\\le 2$ for all $i$, and $$\\\\left| \\\\sum_{i = 1}^{k} a_{t_i} \\\\right| \\\\ge C.$$\"}","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":[]}