{"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":"f4c98847-60bb-5bce-94c7-3e49c9da57b4","task_key":"test--f4c98847-60bb-5bce-94c7-3e49c9da57b4","task_revision_id":"1","upstream_id":"","short_description":"We have two piles with $2000$ and $2017$ coins respectively.","config":"","split":"test","body":"{\"problem\":\"We have two piles with $2000$ and $2017$ coins respectively. \\nAnn and Bob take alternate turns making the following moves: \\nThe player whose turn is to move picks a pile with at least two coins, removes from that pile $t$ coins for some $2\\\\le  t \\\\le 4$, and adds to the other pile $1$ coin. The players can choose a different $t$ at each turn, and the player who cannot make a move loses. \\nIf Ann plays \\ffirst determine which player has a winning strategy.\"}","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":[]}