{"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":"27fe5e83-f685-5088-bca6-84609cde7612","task_key":"test--27fe5e83-f685-5088-bca6-84609cde7612","task_revision_id":"1","upstream_id":"","short_description":"A $9\\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles…","config":"","split":"test","body":"{\"problem\":\"A $9\\\\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with $90^\\\\circ$) and square tiles composed by four unit squares.\\nLet $n\\\\ge 0$ be the number of the $2 \\\\times 2 $ tiles which can be used in such a tiling. Find all the values of $n$.\"}","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":[]}