{"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":"7a1da9d7-d55c-55b6-8426-f0692ece2a9d","task_key":"test--7a1da9d7-d55c-55b6-8426-f0692ece2a9d","task_revision_id":"1","upstream_id":"","short_description":"Let $N$ be the number of ways in which the letters in \"HMMTHMMTHMMTHMMTHMMTHMMT\"…","config":"","split":"test","body":"{\"problem\":\"Let $N$ be the number of ways in which the letters in \\\"HMMTHMMTHMMTHMMTHMMTHMMT\\\" (\\\"HMMT\\\" repeated six times) can be rearranged so that each letter is adjacent to another copy of the same letter. For example, \\\"MMMMMMTTTTTTHHHHHHHHHHHH\\\" satisfies this property, but \\\"HMMMMMTTTTTTHHHHHHHHHHHM\\\" does not. Estimate $N$. An estimate of $E$ will earn $\\\\left\\\\lfloor 20 \\\\min \\\\left(\\\\frac{N}{E}, \\\\frac{E}{N}\\\\right)^{4}\\\\right\\\\rfloor$ points.\"}","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":[]}