{"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":"3f28dda4-1ffc-546d-a31e-555928487cd2","task_key":"test--3f28dda4-1ffc-546d-a31e-555928487cd2","task_revision_id":"1","upstream_id":"","short_description":"You are given 16 pieces of paper numbered $16,15, \\ldots, 2,1$ in that order.…","config":"","split":"test","body":"{\"problem\":\"You are given 16 pieces of paper numbered $16,15, \\\\ldots, 2,1$ in that order. You want to put them in the order $1,2, \\\\ldots, 15,16$ switching only two adjacent pieces of paper at a time. What is the minimum number of switches necessary?\"}","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":[]}