{"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":"033067f8-f6af-5a4c-ac49-48f40ec5b030","task_key":"test--033067f8-f6af-5a4c-ac49-48f40ec5b030","task_revision_id":"1","upstream_id":"","short_description":"For distinct positive integers $a, b<2012$, define $f(a, b)$ to be the number of…","config":"","split":"test","body":"{\"problem\":\"For distinct positive integers $a, b<2012$, define $f(a, b)$ to be the number of integers $k$ with $1\\\\le k<2012$ such that the remainder when $ak$ divided by $2012$ is greater than that of $bk$ divided by $2012$. Let $S$ be the minimum value of $f(a, b)$, where $a$ and $b$ range over all pairs of distinct positive integers less than $2012$. Determine $S$.\"}","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":[]}