{"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":"94925dd8-d878-564b-be9c-175220db5693","task_key":"test--94925dd8-d878-564b-be9c-175220db5693","task_revision_id":"1","upstream_id":"","short_description":"Yang has the sequence of integers $1,2, \\ldots, 2017$. He makes 2016 swaps in…","config":"","split":"test","body":"{\"problem\":\"Yang has the sequence of integers $1,2, \\\\ldots, 2017$. He makes 2016 swaps in order, where a swap changes the positions of two integers in the sequence. His goal is to end with $2,3, \\\\ldots, 2017,1$. How many different sequences of swaps can Yang do to achieve his goal?\"}","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":[]}