{"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":"ce2e69f3-7a01-50b7-b035-85d199354590","task_key":"test--ce2e69f3-7a01-50b7-b035-85d199354590","task_revision_id":"1","upstream_id":"","short_description":"Given positive integers \\(a_{1}, a_{2}, \\ldots, a_{2023}\\) such that…","config":"","split":"test","body":"{\"problem\":\"Given positive integers \\\\(a_{1}, a_{2}, \\\\ldots, a_{2023}\\\\) such that \\\\(a_{k}=\\\\sum_{i=1}^{2023}\\\\left|a_{k}-a_{i}\\\\right|\\\\) for all \\\\(1 \\\\leq k \\\\leq 2023\\\\), find the minimum possible value of \\\\(a_{1}+a_{2}+\\\\cdots+a_{2023}\\\\).\"}","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":[]}