{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"olympiadbench","formal_name":"OlympiadBench","introduction":"OlympiadBench evaluates scientific reasoning on Olympiad-level mathematics and physics problems. Its official description lists 8,476 English and Chinese problems with separate text-only and multimodal settings.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/OpenBMB/OlympiadBench","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"c0ec2641-d8a9-564b-be84-970d475e8653","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1644","task_revision_id":"3","upstream_id":"1644","short_description":"Given positive integers $m$ and $n \\geq m$, determine the largest number of…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Given positive integers $m$ and $n \\\\geq m$, determine the largest number of dominoes $(1 \\\\times 2$ or $2 \\\\times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2 n$ columns consisting of cells $(1 \\\\times 1$ squares $)$ so that:\\n\\n\\n\\n(i) each domino covers exactly two adjacent cells of the board;\\n\\n\\n\\n(ii) no two dominoes overlap;\\n\\n\\n\\n(iii) no two form a $2 \\\\times 2$ square; and\\n\\n\\n\\n(iv) the bottom row of the board is completely covered by $n$ dominoes.\",\"question_type\":\"Open-ended\",\"subject\":\"Math\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/OpenBMB/OlympiadBench","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}