{"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":"e6123736-c678-5d16-b358-678167c8ffe2","task_key":"test--e6123736-c678-5d16-b358-678167c8ffe2","task_revision_id":"1","upstream_id":"","short_description":"For any positive integer $x$, define $\\operatorname{Accident}(x)$ to be the set…","config":"","split":"test","body":"{\"problem\":\"For any positive integer $x$, define $\\\\operatorname{Accident}(x)$ to be the set of ordered pairs $(s, t)$ with $s \\\\in \\\\{0,2,4,5,7,9,11\\\\}$ and $t \\\\in\\\\{1,3,6,8,10\\\\}$ such that $x+s-t$ is divisible by 12. For any nonnegative integer $i$, let $a_{i}$ denote the number of $x \\\\in\\\\{0,1, \\\\ldots, 11\\\\}$ for which $|\\\\operatorname{Accident}(x)|=i$. Find $$a_{0}^{2}+a_{1}^{2}+a_{2}^{2}+a_{3}^{2}+a_{4}^{2}+a_{5}^{2}$$\"}","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":[]}