{"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":"0a787b72-686a-573d-a0ce-ba8fa60c4cfb","task_key":"test--0a787b72-686a-573d-a0ce-ba8fa60c4cfb","task_revision_id":"1","upstream_id":"","short_description":"Alec wishes to construct a string of 6 letters using the letters A, C, G, and N,…","config":"","split":"test","body":"{\"problem\":\"Alec wishes to construct a string of 6 letters using the letters A, C, G, and N, such that: - The first three letters are pairwise distinct, and so are the last three letters; - The first, second, fourth, and fifth letters are pairwise distinct. In how many ways can he construct the string?\"}","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":[]}