{"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":"4d353750-b381-5b95-a368-c8027b81c887","task_key":"test--4d353750-b381-5b95-a368-c8027b81c887","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \\\\le n$. The rules of the game are:\\n\\n(i) A player cannot choose a number that has been chosen by either player on any previous turn.\\n(ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn.\\n(iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game.\\n\\nThe player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies.\\n\\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":[]}