{"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":"023666b5-2b19-54df-bda8-8f880b114cfc","task_key":"test--023666b5-2b19-54df-bda8-8f880b114cfc","task_revision_id":"1","upstream_id":"","short_description":"Let $n>1$ be a positive integer. Each unit square in an $n \\times n$ grid of…","config":"","split":"test","body":"{\"problem\":\"Let $n>1$ be a positive integer. Each unit square in an $n \\\\times n$ grid of squares is colored either black or white, such that the following conditions hold: - Any two black squares can be connected by a sequence of black squares where every two consecutive squares in the sequence share an edge; - Any two white squares can be connected by a sequence of white squares where every two consecutive squares in the sequence share an edge; - Any $2 \\\\times 2$ subgrid contains at least one square of each color. Determine, with proof, the maximum possible difference between the number of black squares and white squares in this grid (in terms of $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":[]}