{"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":"50e44d22-4c81-517c-b313-c9b928995160","task_key":"test--50e44d22-4c81-517c-b313-c9b928995160","task_revision_id":"3","upstream_id":"","short_description":"Let $a_1,a_2,\\cdots,a_n$ be a permutation of $1,2,\\cdots,n$. Among all possible…","config":"","split":"test","body":"{\"problem\":\"Let $a_1,a_2,\\\\cdots,a_n$ be a permutation of $1,2,\\\\cdots,n$. Among all possible permutations, find the minimum of  $$\\\\sum_{i=1}^n \\\\min \\\\{ a_i,2i-1 \\\\}.$$\"}","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":[]}