{"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":"30bf57d2-0c5f-5ea8-b7e3-f4602bbd4cc9","task_key":"test--30bf57d2-0c5f-5ea8-b7e3-f4602bbd4cc9","task_revision_id":"1","upstream_id":"","short_description":"For any finite sequence of positive integers \\pi, let $S(\\pi)$ be the number of…","config":"","split":"test","body":"{\"problem\":\"For any finite sequence of positive integers \\\\pi, let $S(\\\\pi)$ be the number of strictly increasing subsequences in \\\\pi with length 2 or more. For example, in the sequence $\\\\pi=\\\\{3,1,2,4\\\\}$, there are five increasing sub-sequences: $\\\\{3,4\\\\},\\\\{1,2\\\\},\\\\{1,4\\\\},\\\\{2,4\\\\}$, and $\\\\{1,2,4\\\\}$, so $S(\\\\pi)=5$. In an eight-player game of Fish, Joy is dealt six cards of distinct values, which she puts in a random order \\\\pi from left to right in her hand. Determine $\\\\sum_{\\\\pi} S(\\\\pi)$ where the sum is taken over all possible orders \\\\pi of the card values.\"}","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":[]}