{"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":"54a339f0-0d88-55ca-9b1b-5076ddf6ffac","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2004","task_revision_id":"1","upstream_id":"2004","short_description":"$A \\pm 1 \\text{-}sequence$ is a sequence of 2022 numbers $a_{1}, \\ldots,…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"$A \\\\pm 1 \\\\text{-}sequence$ is a sequence of 2022 numbers $a_{1}, \\\\ldots, a_{2022}$, each equal to either +1 or -1 . Determine the largest $C$ so that, for any $\\\\pm 1 -sequence$, there exists an integer $k$ and indices $1 \\\\leqslant t_{1}<\\\\ldots<t_{k} \\\\leqslant 2022$ so that $t_{i+1}-t_{i} \\\\leqslant 2$ for all $i$, and\\n\\n$$\\n\\\\left|\\\\sum_{i=1}^{k} a_{t_{i}}\\\\right| \\\\geqslant C\\n$$\",\"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":[]}