{"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":"dcf97ac8-f5d5-503b-a468-d038cbe0d553","task_key":"test--dcf97ac8-f5d5-503b-a468-d038cbe0d553","task_revision_id":"1","upstream_id":"","short_description":"Two players play a game, starting with a pile of \\(N\\) tokens. On each player's…","config":"","split":"test","body":"{\"problem\":\"Two players play a game, starting with a pile of \\\\(N\\\\) tokens. On each player's turn, they must remove \\\\(2^{n}\\\\) tokens from the pile for some nonnegative integer \\\\(n\\\\). If a player cannot make a move, they lose. For how many \\\\(N\\\\) between 1 and 2019 (inclusive) does the first player have 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":[]}