{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"b06af4ab-8f88-50b7-b846-dab19ed2d328","task_key":"test--b06af4ab-8f88-50b7-b846-dab19ed2d328","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be a fixed positive integer. Find the maximum possible value of \\[…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be a fixed positive integer. Find the maximum possible value of \\\\[ \\\\sum_{1 \\\\le r < s \\\\le 2n} (s-r-n)x_rx_s, \\\\] where $-1 \\\\le x_i \\\\le 1$ for all $i = 1, \\\\cdots , 2n$.\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}