{"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":"2bd88933-8ead-575c-85f4-8890032a70ea","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2319","task_revision_id":"1","upstream_id":"2319","short_description":"A Skolem sequence of order $n$ is a sequence $\\left(s_{1}, s_{2}, \\ldots, s_{2…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Tuple\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"A Skolem sequence of order $n$ is a sequence $\\\\left(s_{1}, s_{2}, \\\\ldots, s_{2 n}\\\\right)$ of $2 n$ integers satisfying the conditions:\\n\\ni) for every $k$ in $\\\\{1,2,3, \\\\ldots, n\\\\}$, there exist exactly two elements $s_{i}$ and $s_{j}$ with $s_{i}=s_{j}=k$, and\\n\\nii) if $s_{i}=s_{j}=k$ with $i<j$, then $j-i=k$.\\n\\n\\nFor example, $(4,2,3,2,4,3,1,1)$ is a Skolem sequence of order 4.\\nDetermine, with justification, all Skolem sequences of order 9 which satisfy all of the following three conditions:\\nI) $s_{3}=1$,\\n\\nII) $s_{18}=8$, and\\n\\nIII) between any two equal even integers, there is exactly one odd integer.\",\"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":[]}