{"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":"75fc8ca7-20e6-54bc-9d5c-900949141d58","task_key":"test--75fc8ca7-20e6-54bc-9d5c-900949141d58","task_revision_id":"1","upstream_id":"","short_description":"Suppose that $(a_{1}, \\ldots, a_{20})$ and $(b_{1}, \\ldots, b_{20})$ are two…","config":"","split":"test","body":"{\"problem\":\"Suppose that $(a_{1}, \\\\ldots, a_{20})$ and $(b_{1}, \\\\ldots, b_{20})$ are two sequences of integers such that the sequence $(a_{1}, \\\\ldots, a_{20}, b_{1}, \\\\ldots, b_{20})$ contains each of the numbers $1, \\\\ldots, 40$ exactly once. What is the maximum possible value of the sum $\\\\sum_{i=1}^{20} \\\\sum_{j=1}^{20} \\\\min (a_{i}, b_{j})$?\"}","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":[]}