{"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":"6ede16e3-a89c-550e-bef3-a27662d4cb41","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2230","task_revision_id":"1","upstream_id":"2230","short_description":"Let $k$ be a positive integer. Lexi has a dictionary $\\mathcal{D}$ consisting of…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Let $k$ be a positive integer. Lexi has a dictionary $\\\\mathcal{D}$ consisting of some $k$-letter strings containing only the letters $A$ and $B$. Lexi would like to write either the letter $A$ or the letter $B$ in each cell of a $k \\\\times k$ grid so that each column contains a string from $\\\\mathcal{D}$ when read from top-to-bottom and each row contains a string from $\\\\mathcal{D}$ when read from left-to-right.\\n\\nWhat is the smallest integer $m$ such that if $\\\\mathcal{D}$ contains at least $m$ different strings, then Lexi can fill her grid in this manner, no matter what strings are in $\\\\mathcal{D}$ ?\",\"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":[]}