{"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":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"693ba4aa-1522-547f-b745-3f404e1c80b3","task_key":"test--693ba4aa-1522-547f-b745-3f404e1c80b3","task_revision_id":"1","upstream_id":"","short_description":"Let $ n$ and $ k$ be positive integers such that $ \\frac{1}{2} n < k \\leq…","config":"","split":"test","body":"{\"problem\":\"Let $ n$ and $ k$ be positive integers such that $ \\\\frac{1}{2} n < k \\\\leq \\\\frac{2}{3} n.$ Find the least number $ m$ for which it is possible to place $ m$ pawns on $ m$ squares of an $ n \\\\times n$ chessboard so that no column or row contains a block of $ k$ adjacent unoccupied squares.\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}