{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"3191ff2a-47ac-5a01-a7b5-c6be16813981","task_key":"test--3191ff2a-47ac-5a01-a7b5-c6be16813981","task_revision_id":"2","upstream_id":"","short_description":"For a given integer $n\\ge 2$, let $a_0,a_1,\\ldots ,a_n$ be integers satisfying…","config":"","split":"test","body":"{\"problem\":\"For a given integer $n\\\\ge 2$, let $a_0,a_1,\\\\ldots ,a_n$ be integers satisfying $0=a_0<a_1<\\\\ldots <a_n=2n-1$. Find the smallest possible number of elements in the set $\\\\{ a_i+a_j \\\\mid 0\\\\le i \\\\le j \\\\le n \\\\}$.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}