{"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":"fbd09dff-7c75-5b1a-9fef-20e9d90f6b78","task_key":"test--fbd09dff-7c75-5b1a-9fef-20e9d90f6b78","task_revision_id":"1","upstream_id":"","short_description":"All the sequences consisting of five letters from the set $\\{T, U, R, N, I, P\\}$…","config":"","split":"test","body":"{\"problem\":\"All the sequences consisting of five letters from the set $\\\\{T, U, R, N, I, P\\\\}$ (with repetitions allowed) are arranged in alphabetical order in a dictionary. Two sequences are called \\\"anagrams\\\" of each other if one can be obtained by rearranging the letters of the other. How many pairs of anagrams are there that have exactly 100 other sequences between them in the dictionary?\"}","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":[]}