{"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":"50714739-396e-5663-9fa2-39264a0eeb35","task_key":"test--50714739-396e-5663-9fa2-39264a0eeb35","task_revision_id":"1","upstream_id":"","short_description":"The numbers $a_{1}, a_{2}, \\ldots, a_{100}$ are a permutation of the numbers…","config":"","split":"test","body":"{\"problem\":\"The numbers $a_{1}, a_{2}, \\\\ldots, a_{100}$ are a permutation of the numbers $1,2, \\\\ldots, 100$. Let $S_{1}=a_{1}$, $S_{2}=a_{1}+a_{2}, \\\\ldots, S_{100}=a_{1}+a_{2}+\\\\ldots+a_{100}$. What maximum number of perfect squares can be among the numbers $S_{1}, S_{2}, \\\\ldots, S_{100}$?\"}","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":[]}