{"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":"7d5c3538-1ecc-5b83-8196-79ddde34ad88","task_key":"test--7d5c3538-1ecc-5b83-8196-79ddde34ad88","task_revision_id":"1","upstream_id":"","short_description":"Count the number of permutations $a_{1} a_{2} \\ldots a_{7}$ of 1234567 with…","config":"","split":"test","body":"{\"problem\":\"Count the number of permutations $a_{1} a_{2} \\\\ldots a_{7}$ of 1234567 with longest decreasing subsequence of length at most two (i.e. there does not exist $i<j<k$ such that $a_{i}>a_{j}>a_{k}$ ).\"}","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":[]}