{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"672258b9-33eb-5028-923e-d9828313218f","task_key":"test--672258b9-33eb-5028-923e-d9828313218f","task_revision_id":"3","upstream_id":"","short_description":"Consider a $2n \\times 2n$ board. From the $i$ th line we remove the central…","config":"","split":"test","body":"{\"problem\":\"Consider a $2n \\\\times 2n$ board. From the $i$ th line we remove the central $2(i-1)$ unit squares. What is the maximal number of rectangles $2 \\\\times 1$ and $1 \\\\times 2$ that can be placed on the obtained figure without overlapping or getting outside the board?\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}