{"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":"4f2c3a84-1f41-5bfe-913a-f8eb4c1a3f62","task_key":"test--4f2c3a84-1f41-5bfe-913a-f8eb4c1a3f62","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be an even positive integer. We say that two different cells of a $n…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be an even positive integer. We say that two different cells of a $n \\\\times n$ board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the $n \\\\times n$ board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.\"}","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":[]}