{"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":"c179ab40-3cc4-5835-b09b-39cf32a47d06","task_key":"test--c179ab40-3cc4-5835-b09b-39cf32a47d06","task_revision_id":"1","upstream_id":"","short_description":"An empty $2020 \\times 2020 \\times 2020$ cube is given, and a $2020 \\times 2020$…","config":"","split":"test","body":"{\"problem\":\"An empty $2020 \\\\times 2020 \\\\times 2020$ cube is given, and a $2020 \\\\times 2020$ grid of square unit cells is drawn on each of its six faces. A beam is a $1 \\\\times 1 \\\\times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions:\\nThe two faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are possible positions for a beam.)  No two beams have intersecting interiors.  The interiors of each of the four faces of each beam touch either a face of the cube or the interior of the face of another beam.\\nWhat is the smallest positive number of beams that can be placed to satisfy these conditions?\"}","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":[]}