{"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":"ec816c0a-9df6-5901-91b3-43eca19cbc33","task_key":"test--ec816c0a-9df6-5901-91b3-43eca19cbc33","task_revision_id":"4","upstream_id":"","short_description":"Let $ n(\\ge2) $ be a positive integer. Find the minimum $ m $, so that there…","config":"","split":"test","body":"{\"problem\":\"Let $ n(\\\\ge2) $ be a positive integer. Find the minimum $ m $, so that there exists $x_{ij}(1\\\\le i ,j\\\\le n)$ satisfying:\\n(1)For every $1\\\\le i ,j\\\\le n, x_{ij}=max\\\\{x_{i1},x_{i2},...,x_{ij}\\\\} $ or $ x_{ij}=max\\\\{x_{1j},x_{2j},...,x_{ij}\\\\}.$\\n(2)For every $1\\\\le i \\\\le n$, there are at most $m$ indices $k$ with $x_{ik}=max\\\\{x_{i1},x_{i2},...,x_{ik}\\\\}.$\\n(3)For every $1\\\\le j \\\\le n$, there are at most $m$ indices $k$ with $x_{kj}=max\\\\{x_{1j},x_{2j},...,x_{kj}\\\\}.$\"}","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":[]}