{"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":"d4ef7c4d-f553-5894-b52e-1dfd2900a31b","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2204","task_revision_id":"3","upstream_id":"2204","short_description":"Let $n$ be a positive integer. Dominoes are placed on a $2 n \\times 2 n$ board…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Let $n$ be a positive integer. Dominoes are placed on a $2 n \\\\times 2 n$ board in such a way that every cell of the board is adjacent to exactly one cell covered by a domino. For each $n$, determine the largest number of dominoes that can be placed in this way.\\n\\n(A domino is a tile of size $2 \\\\times 1$ or $1 \\\\times 2$. Dominoes are placed on the board in such a way that each domino covers exactly two cells of the board, and dominoes do not overlap. Two cells are said to be adjacent if they are different and share a common side.)\",\"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":[]}