{"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":"a58fb1ec-b184-5072-94ad-03682c987b5f","task_key":"test--a58fb1ec-b184-5072-94ad-03682c987b5f","task_revision_id":"4","upstream_id":"","short_description":"Let $n \\geq 3$ be an odd number and suppose that each square in a $n \\times n$…","config":"","split":"test","body":"{\"problem\":\"Let $n \\\\geq 3$ be an odd number and suppose that each square in a $n \\\\times n$ chessboard is colored either black or white. Two squares are considered adjacent if they are of the same color and share a common vertex and two squares $a,b$ are considered connected if there exists a sequence of squares $c_1,\\\\ldots,c_k$ with $c_1 = a, c_k = b$ such that $c_i, c_{i+1}$ are adjacent for $i=1,2,\\\\ldots,k-1$. \\n\\\\\\\\\\n\\\\\\\\\\nFind the maximal number $M$ such that there exists a coloring admitting $M$ pairwise disconnected squares.\"}","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":[]}