{"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":"1afd14fd-9523-5bb6-89b1-ad3cad7d076d","task_key":"test--1afd14fd-9523-5bb6-89b1-ad3cad7d076d","task_revision_id":"1","upstream_id":"","short_description":"For integers $a, b, c, d$, let $f(a, b, c, d)$ denote the number of ordered…","config":"","split":"test","body":"{\"problem\":\"For integers $a, b, c, d$, let $f(a, b, c, d)$ denote the number of ordered pairs of integers $(x, y) \\\\in \\\\{1,2,3,4,5\\\\}^{2}$ such that $a x+b y$ and $c x+d y$ are both divisible by 5. Find the sum of all possible values of $f(a, b, c, d)$.\"}","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":[]}