{"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":"4ef67911-d96d-59b2-a576-50c9a4f23e17","task_key":"test--4ef67911-d96d-59b2-a576-50c9a4f23e17","task_revision_id":"1","upstream_id":"","short_description":"Each square in a $3 \\times 10$ grid is colored black or white. Let $N$ be the…","config":"","split":"test","body":"{\"problem\":\"Each square in a $3 \\\\times 10$ grid is colored black or white. Let $N$ be the number of ways this can be done in such a way that no five squares in an 'X' configuration (as shown by the black squares below) are all white or all black. Determine $\\\\sqrt{N}$.\"}","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":[]}