{"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":"c960d056-2cb1-563f-9986-c929bb69c7b7","task_key":"test--c960d056-2cb1-563f-9986-c929bb69c7b7","task_revision_id":"1","upstream_id":"","short_description":"An apartment building consists of 20 rooms numbered $1,2, \\ldots, 20$ arranged…","config":"","split":"test","body":"{\"problem\":\"An apartment building consists of 20 rooms numbered $1,2, \\\\ldots, 20$ arranged clockwise in a circle. To move from one room to another, one can either walk to the next room clockwise (i.e. from room $i$ to room $(i+1)(\\\\bmod 20))$ or walk across the center to the opposite room (i.e. from room $i$ to room $(i+10)(\\\\bmod 20))$. Find the number of ways to move from room 10 to room 20 without visiting the same room twice.\"}","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":[]}