{"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":"6665922e-1b96-5eb6-bc75-554fb4ae1a76","task_key":"test--6665922e-1b96-5eb6-bc75-554fb4ae1a76","task_revision_id":"3","upstream_id":"","short_description":"Let $n$ be a positive integer. There are $\\tfrac{n(n+1)}{2}$ marks, each with a…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be a positive integer.  There are $\\\\tfrac{n(n+1)}{2}$ marks, each with a black side and a white side, arranged into an equilateral triangle, with the biggest row containing $n$ marks.  Initially, each mark has the black side up.  An operation is to choose a line parallel to the sides of the triangle, and flipping all the marks on that line.  A configuration is called admissible if it can be obtained from the initial configuration by performing a finite number of operations.  For each admissible configuration $C$ , let $f(C)$ denote the smallest number of operations required to obtain $C$ from the initial configuration.  Find the maximum value of $f(C)$ , where $C$ varies over all admissible configurations.\"}","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":[]}