{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"amc","formal_name":"AMC (AIMO validation set)","introduction":"83 AMC 12 problems assembled by Project Numina as a validation set for the AIMO competition. They sit a step below AIME in difficulty, which makes them a useful lower rung on the same scale.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/AI-MO/aimo-validation-amc","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"ee78e0c0-ef82-575a-8588-1ff4ac9e8a46","task_key":"default--train--https~3a~2f~2fartofproblemsolving~2ecom~2fwiki~2findex~2ephp~2f2022~5fAMC~5f12A~5fProblems~2fProblem~5f19","task_revision_id":"2","upstream_id":"https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_19","short_description":"Suppose that $13$ cards numbered $1, 2, 3, \\ldots, 13$ are arranged in a row.…","config":"default","split":"train","body":"{\"problem\":\"Suppose that $13$ cards numbered $1, 2, 3, \\\\ldots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards $1, 2, 3$ are picked up on the first pass, $4$ and $5$ on the second pass, $6$ on the third pass, $7, 8, 9, 10$ on the fourth pass, and $11, 12, 13$ on the fifth pass. For how many of the $13!$ possible orderings of the cards will the $13$ cards be picked up in exactly two passes?\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/AI-MO/aimo-validation-amc","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}