{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"数学オリンピック水準の問題を通じて、数学的推論能力を評価するベンチマークです。公式データは4,428問を収録し、分野や難易度の情報を伴います。\n\nOmni-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":"noindex"},"task_id":"3029afd0-de3a-5160-b40d-abc31fafede7","task_key":"test--3029afd0-de3a-5160-b40d-abc31fafede7","task_revision_id":"2","upstream_id":"","short_description":"Find the maximum possible number of three term arithmetic progressions in a…","config":"","split":"test","body":"{\"problem\":\"Find the maximum possible number of three term arithmetic progressions in a monotone sequence of $n$ distinct reals.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}