{"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":"dd676528-949f-5490-ba7c-4658b6431168","task_key":"test--dd676528-949f-5490-ba7c-4658b6431168","task_revision_id":"1","upstream_id":"","short_description":"Let $S_{0}=0$ and let $S_{k}$ equal $a_{1}+2 a_{2}+\\ldots+k a_{k}$ for $k \\geq…","config":"","split":"test","body":"{\"problem\":\"Let $S_{0}=0$ and let $S_{k}$ equal $a_{1}+2 a_{2}+\\\\ldots+k a_{k}$ for $k \\\\geq 1$. Define $a_{i}$ to be 1 if $S_{i-1}<i$ and -1 if $S_{i-1} \\\\geq i$. What is the largest $k \\\\leq 2010$ such that $S_{k}=0$?\"}","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":[]}