{"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":"5d08ad15-06d5-5a8e-bee8-5cda34cf4ee1","task_key":"test--5d08ad15-06d5-5a8e-bee8-5cda34cf4ee1","task_revision_id":"1","upstream_id":"","short_description":"A restricted path of length $n$ is a path of length $n$ such that for all $i$…","config":"","split":"test","body":"{\"problem\":\"A restricted path of length $n$ is a path of length $n$ such that for all $i$ between 1 and $n-2$ inclusive, if the $i$th step is upward, the $i+1$st step must be rightward. Find the number of restricted paths that start at $(0,0)$ and end at $(7,3)$.\"}","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":[]}