{"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":"f346f4b3-500f-5758-9746-4a191e5fa2ff","task_key":"test--f346f4b3-500f-5758-9746-4a191e5fa2ff","task_revision_id":"1","upstream_id":"","short_description":"2500 chess kings have to be placed on a $100 \\times 100$ chessboard so that","config":"","split":"test","body":"{\"problem\":\"2500 chess kings have to be placed on a $100 \\\\times 100$ chessboard so that\\n\\n[b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex);\\n[b](ii)[/b] each row and each column contains exactly 25 kings.\\n\\nFind the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.)\\n\\n[i]\"}","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":[]}