{"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":"8cbd4954-0825-56af-af0c-d2ee2b6b0023","task_key":"test--8cbd4954-0825-56af-af0c-d2ee2b6b0023","task_revision_id":"1","upstream_id":"","short_description":"Find the smallest \\(k\\) such that for any arrangement of 3000 checkers in a…","config":"","split":"test","body":"{\"problem\":\"Find the smallest \\\\(k\\\\) such that for any arrangement of 3000 checkers in a \\\\(2011 \\\\times 2011\\\\) checkerboard, with at most one checker in each square, there exist \\\\(k\\\\) rows and \\\\(k\\\\) columns for which every checker is contained in at least one of these rows or columns.\"}","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":[]}