{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"olympiadbench","formal_name":"OlympiadBench","introduction":"OlympiadBench 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","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"81d4229a-0224-5e1a-a146-f33678723ed7","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1939","task_revision_id":"2","upstream_id":"1939","short_description":"Let $n$ be a fixed positive integer. Find the maximum possible value of","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Let $n$ be a fixed positive integer. Find the maximum possible value of\\n\\n$$\\n\\\\sum_{1 \\\\leqslant r<s \\\\leqslant 2 n}(s-r-n) x_{r} x_{s}\\n$$\\n\\nwhere $-1 \\\\leqslant x_{i} \\\\leqslant 1$ for all $i=1,2, \\\\ldots, 2 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":[]}