{"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":"648ac744-9d36-5671-b3f0-fe221d46b6e6","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1736","task_revision_id":"1","upstream_id":"1736","short_description":"Find the least positive integer $n$ for which there exists a set $\\left\\{s_{1},…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Find the least positive integer $n$ for which there exists a set $\\\\left\\\\{s_{1}, s_{2}, \\\\ldots, s_{n}\\\\right\\\\}$ consisting of $n$ distinct positive integers such that\\n\\n$$\\n\\\\left(1-\\\\frac{1}{s_{1}}\\\\right)\\\\left(1-\\\\frac{1}{s_{2}}\\\\right) \\\\ldots\\\\left(1-\\\\frac{1}{s_{n}}\\\\right)=\\\\frac{51}{2010}\\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":[]}