{"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":"225b144d-1d53-54ef-98f0-550be7fc611f","task_key":"test--225b144d-1d53-54ef-98f0-550be7fc611f","task_revision_id":"2","upstream_id":"","short_description":"Consider pairs $(f,g)$ of functions from the set of nonnegative integers to…","config":"","split":"test","body":"{\"problem\":\"Consider pairs $(f,g)$ of functions from the set of nonnegative integers to itself such that \\n[list]\\n[*]$f(0) \\\\geq f(1) \\\\geq f(2) \\\\geq \\\\dots \\\\geq f(300) \\\\geq 0$\\n[*]$f(0)+f(1)+f(2)+\\\\dots+f(300) \\\\leq 300$\\n[*]for any 20 nonnegative integers $n_1, n_2, \\\\dots, n_{20}$, not necessarily distinct, we have $$g(n_1+n_2+\\\\dots+n_{20}) \\\\leq f(n_1)+f(n_2)+\\\\dots+f(n_{20}).$$\\n[/list]\\nDetermine the maximum possible value of $g(0)+g(1)+\\\\dots+g(6000)$ over all such pairs of functions.\\n\\n[i]Sean Li[/i]\"}","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":[]}