{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"7dedcbcc-3757-5cca-b401-fb90000f6347","task_key":"test--7dedcbcc-3757-5cca-b401-fb90000f6347","task_revision_id":"3","upstream_id":"","short_description":"Find the greatest constant $\\lambda$ such that for any doubly stochastic matrix…","config":"","split":"test","body":"{\"problem\":\"Find the greatest constant $\\\\lambda$ such that for any doubly stochastic matrix of order 100, we can pick $150$ entries such that if the other $9850$ entries were replaced by $0$, the sum of entries in each row and each column is at least $\\\\lambda$.\\n\\nNote: A doubly stochastic matrix of order $n$ is a $n\\\\times n$ matrix, all entries are nonnegative reals, and the sum of entries in each row and column is equal to 1.\"}","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":[]}