{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"olympiadbench","formal_name":"OlympiadBench","introduction":"数学と物理のオリンピック水準の問題で、科学的推論を評価するベンチマークです。公式紹介では英語・中国語の8,476問を収録し、テキストのみと画像付きの設定を区別します。\n\nOlympiadBench 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"},"task_id":"78a8c16c-dea1-552d-af43-e4c2ba55b5b7","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1614","task_revision_id":"1","upstream_id":"1614","short_description":"Let $n$ be an integer greater than 1 and let $X$ be an $n$-element set. A…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Let $n$ be an integer greater than 1 and let $X$ be an $n$-element set. A non-empty collection of subsets $A_{1}, \\\\ldots, A_{k}$ of $X$ is tight if the union $A_{1} \\\\cup \\\\cdots \\\\cup A_{k}$ is a proper subset of $X$ and no element of $X$ lies in exactly one of the $A_{i}$ s. Find the largest cardinality of a collection of proper non-empty subsets of $X$, no non-empty subcollection of which is tight.\\n\\n\\n\\nNote. A subset $A$ of $X$ is proper if $A \\\\neq X$. The sets in a collection are assumed to be distinct. The whole collection is assumed to be a subcollection.\",\"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":[]}