{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"aime-2024","formal_name":"AIME 2024","introduction":"The 30 problems of the 2024 American Invitational Mathematics Examination (AIME I and II). Every answer is an integer from 0 to 999, with no options and no partial credit. It is a frequent reference point for reasoning models.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/Maxwell-Jia/AIME_2024","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"af5bf059-eeab-5ff3-92fa-75bd78c29ce3","task_key":"default--train--af5bf059-eeab-5ff3-92fa-75bd78c29ce3","task_revision_id":"2","upstream_id":"","short_description":"AIME 2024 train af5bf059-eeab-5ff3-92fa-75bd78c29ce3","config":"default","split":"train","body":"{\"Problem\":\"Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ for which there exists a strategy for Bob that guarantees that Bob will win the game regardless of Alice's play.\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/Maxwell-Jia/AIME_2024","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}