{"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":"910ddfe0-0c48-5b94-9e54-9616d21f98de","task_key":"test--910ddfe0-0c48-5b94-9e54-9616d21f98de","task_revision_id":"4","upstream_id":"","short_description":"Let $n$ be a positive integer. Initially, a $2n \\times 2n$ grid has $k$ black…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be a positive integer. Initially, a $2n \\\\times 2n$ grid has $k$ black cells and the rest white cells. The following two operations are allowed :\\n(1) If a $2\\\\times 2$ square has exactly three black cells, the fourth is changed to a black cell; \\n(2) If there are exactly two black cells in a $2 \\\\times 2$ square, the black cells are changed to white and white to black.\\n Find the smallest positive integer $k$ such that for any configuration of the $2n \\\\times 2n$ grid with $k$ black cells, all cells can be black after a finite number of operations.\"}","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":[]}