{"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":"0fc89d98-83f4-5d7e-ac0c-3ef1a2b23ddc","task_key":"test--0fc89d98-83f4-5d7e-ac0c-3ef1a2b23ddc","task_revision_id":"1","upstream_id":"","short_description":"Sally the snail sits on the $3 \\times 24$ lattice of points $(i, j)$ for all $1…","config":"","split":"test","body":"{\"problem\":\"Sally the snail sits on the $3 \\\\times 24$ lattice of points $(i, j)$ for all $1 \\\\leq i \\\\leq 3$ and $1 \\\\leq j \\\\leq 24$. She wants to visit every point in the lattice exactly once. In a move, Sally can move to a point in the lattice exactly one unit away. Given that Sally starts at $(2,1)$, compute the number of possible paths Sally can take.\"}","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":[]}