{"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":"195100e9-5cb5-5c89-a98b-2d4a0bb61ffe","task_key":"test--195100e9-5cb5-5c89-a98b-2d4a0bb61ffe","task_revision_id":"1","upstream_id":"","short_description":"Call a string of letters $S$ an almost palindrome if $S$ and the reverse of $S$…","config":"","split":"test","body":"{\"problem\":\"Call a string of letters $S$ an almost palindrome if $S$ and the reverse of $S$ differ in exactly two places. Find the number of ways to order the letters in $H M M T T H E M E T E A M$ to get an almost palindrome.\"}","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":[]}