{"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":"052eaa5e-5724-536b-8b90-6dc65e62bbf9","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1723","task_revision_id":"1","upstream_id":"1723","short_description":"On some planet, there are $2^{N}$ countries $(N \\geq 4)$. Each country has a…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"On some planet, there are $2^{N}$ countries $(N \\\\geq 4)$. Each country has a flag $N$ units wide and one unit high composed of $N$ fields of size $1 \\\\times 1$, each field being either yellow or blue. No two countries have the same flag.\\n\\nWe say that a set of $N$ flags is diverse if these flags can be arranged into an $N \\\\times N$ square so that all $N$ fields on its main diagonal will have the same color. Determine the smallest positive integer $M$ such that among any $M$ distinct flags, there exist $N$ flags forming a diverse set.\",\"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":[]}