{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"2e9656c9-20cb-5391-9c26-c26f8bef5d79","task_key":"test--2e9656c9-20cb-5391-9c26-c26f8bef5d79","task_revision_id":"2","upstream_id":"","short_description":"Given positive integers $n$ and $k$, $n > k^2 >4.$ In a $n \\times n$ grid, a…","config":"","split":"test","body":"{\"problem\":\"Given positive integers $n$ and $k$, $n > k^2 >4.$ In a $n \\\\times n$ grid, a $k$[i]-group[/i] is a set of $k$ unit squares lying in different rows and different columns.\\nDetermine the maximal possible $N$, such that one can choose $N$ unit squares in the grid and color them, with the following condition holds: in any $k$[i]-group[/i] from the colored $N$ unit squares, there are two squares with the same color, and there are also two squares with different colors.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}