{"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":"05949ea2-cff2-57b9-b686-ed8855ba7153","task_key":"test--05949ea2-cff2-57b9-b686-ed8855ba7153","task_revision_id":"1","upstream_id":"","short_description":"Given a permutation $\\pi$ of the set $\\{1,2, \\ldots, 10\\}$, define a rotated…","config":"","split":"test","body":"{\"problem\":\"Given a permutation $\\\\pi$ of the set $\\\\{1,2, \\\\ldots, 10\\\\}$, define a rotated cycle as a set of three integers $i, j, k$ such that $i<j<k$ and $\\\\pi(j)<\\\\pi(k)<\\\\pi(i)$. What is the total number of rotated cycles over all permutations $\\\\pi$ of the set $\\\\{1,2, \\\\ldots, 10\\\\}$ ?\"}","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":[]}