{"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":"584f1006-d654-5abc-8737-8a96c039f458","task_key":"default--train--https~3a~2f~2fartofproblemsolving~2ecom~2fwiki~2findex~2ephp~2f2022~5fAMC~5f12A~5fProblems~2fProblem~5f24","task_revision_id":"2","upstream_id":"https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_24","short_description":"How many strings of length $5$ formed from the digits $0$, $1$, $2$, $3$, $4$…","config":"default","split":"train","body":"{\"problem\":\"How many strings of length $5$ formed from the digits $0$, $1$, $2$, $3$, $4$ are there such that for each $j \\\\in \\\\{1,2,3,4\\\\}$, at least $j$ of the digits are less than $j$? (For example, $02214$ satisfies this condition\\nbecause it contains at least $1$ digit less than $1$, at least $2$ digits less than $2$, at least $3$ digits less\\nthan $3$, and at least $4$ digits less than $4$. The string $23404$ does not satisfy the condition because it\\ndoes not contain at least $2$ digits less than $2$.)\"}","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":[]}