{"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":"390858f5-ba1b-5e6d-b231-2fe1f671217f","task_key":"test--390858f5-ba1b-5e6d-b231-2fe1f671217f","task_revision_id":"1","upstream_id":"","short_description":"Kolya and Dima play a game on an $8\\times 8$ board, making moves in turn. During…","config":"","split":"test","body":"{\"problem\":\"Kolya and Dima play a game on an $8\\\\times 8$ board, making moves in turn. During his turn, Kolya must put one cross in any empty cell (i.e., in a cell in which a cross has not yet been drawn and which has not yet been covered with a domino). Dima must cover two adjacent cells with a domino (which are not yet covered with other dominoes), in which there are an even number of crosses in total (0 or 2).  The one who can't make a move loses. Which of does the player have a winning strategy, if\\n[list=a]\\n[*]Dima makes the first move?\\n[*]Kolya makes the first move?\\n[/list]\\n[i]\"}","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":[]}