{"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":"53ea4b29-d8ac-522e-ae68-1f9fd62841a2","task_key":"test--53ea4b29-d8ac-522e-ae68-1f9fd62841a2","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be the maximum number of bishops that can be placed on the squares of a…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be the maximum number of bishops that can be placed on the squares of a $6 \\\\times 6$ chessboard such that no two bishops are attacking each other. Let $k$ be the number of ways to put $n$ bishops on an $6 \\\\times 6$ chessboard such that no two bishops are attacking each other. Find $n+k$. (Two bishops are considered to be attacking each other if they lie on the same diagonal. Equivalently, if we label the squares with coordinates $(x, y)$, with $1 \\\\leq x, y \\\\leq 6$, then the bishops on $(a, b)$ and $(c, d)$ are attacking each other if and only if $|a-c|=|b-d|$.)\"}","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":[]}