{"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":"f3a0ee02-bd6a-5c62-a574-29273f3316a7","task_key":"test--f3a0ee02-bd6a-5c62-a574-29273f3316a7","task_revision_id":"1","upstream_id":"","short_description":"Let $n \\ge 2$ be an integer. Consider an $n \\times n$ chessboard consisting of…","config":"","split":"test","body":"{\"problem\":\"Let $n \\\\ge 2$ be an integer. Consider an $n \\\\times n$ chessboard consisting of $n^2$ unit squares. A configuration of $n$ rooks on this board is [i]peaceful[/i] if every row and every column contains exactly one rook. Find the greatest positive integer $k$ such that, for each peaceful configuration of $n$ rooks, there is a $k \\\\times k$ square which does not contain a rook on any of its $k^2$ unit 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":[]}