{"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":"6de731a7-39bb-5654-987b-a2f076e35f16","task_key":"test--6de731a7-39bb-5654-987b-a2f076e35f16","task_revision_id":"1","upstream_id":"","short_description":"Count the number of sequences $a_{1}, a_{2}, a_{3}, a_{4}, a_{5}$ of integers…","config":"","split":"test","body":"{\"problem\":\"Count the number of sequences $a_{1}, a_{2}, a_{3}, a_{4}, a_{5}$ of integers such that $a_{i} \\\\leq 1$ for all $i$ and all partial sums $\\\\left(a_{1}, a_{1}+a_{2}\\\\right.$, etc.) are non-negative.\"}","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":[]}