{"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":"6ff6115b-50fc-58b6-8aa0-4ab0359d1e7d","task_key":"test--6ff6115b-50fc-58b6-8aa0-4ab0359d1e7d","task_revision_id":"1","upstream_id":"","short_description":"For an integer $n \\geq 0$, let $f(n)$ be the smallest possible value of $|x+y|$,…","config":"","split":"test","body":"{\"problem\":\"For an integer $n \\\\geq 0$, let $f(n)$ be the smallest possible value of $|x+y|$, where $x$ and $y$ are integers such that $3 x-2 y=n$. Evaluate $f(0)+f(1)+f(2)+\\\\cdots+f(2013)$.\"}","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":[]}