{"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":"84122f08-d6b3-5871-83be-458d0328bde8","task_key":"test--84122f08-d6b3-5871-83be-458d0328bde8","task_revision_id":"1","upstream_id":"","short_description":"Determine the maximum number of bishops that we can place in a $8 \\times 8$…","config":"","split":"test","body":"{\"problem\":\"Determine the maximum number of bishops that we can place in a $8 \\\\times 8$ chessboard such that there are not two bishops in the same cell, and each bishop is threatened by at most one bishop. \\n\\nNote: A bishop threatens another one, if both are placed in different cells, in the same diagonal. A board has as diagonals the $2$ main diagonals and the ones parallel to those ones.\"}","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":[]}