{"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":"91fc26dc-bb50-5362-b660-ba07f870c5f0","task_key":"test--91fc26dc-bb50-5362-b660-ba07f870c5f0","task_revision_id":"1","upstream_id":"","short_description":"The workers laid a floor of size $n\\times n$ ($10 <n <20$) with two types of…","config":"","split":"test","body":"{\"problem\":\"The workers laid a floor of size $n\\\\times n$ ($10 <n <20$) with two types of tiles: $2 \\\\times 2$ and $5\\\\times 1$. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which $n$ could this happen?  (You can’t cut tiles and also put them on top of each other.)\"}","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":[]}