{"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":"e14a304c-0bf2-5acb-9af8-df261c46848e","task_key":"test--e14a304c-0bf2-5acb-9af8-df261c46848e","task_revision_id":"1","upstream_id":"","short_description":"A function $f:\\{1,2,3,4,5\\} \\rightarrow\\{1,2,3,4,5\\}$ is said to be nasty if…","config":"","split":"test","body":"{\"problem\":\"A function $f:\\\\{1,2,3,4,5\\\\} \\\\rightarrow\\\\{1,2,3,4,5\\\\}$ is said to be nasty if there do not exist distinct $a, b \\\\in\\\\{1,2,3,4,5\\\\}$ satisfying $f(a)=b$ and $f(b)=a$. How many nasty functions are there?\"}","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":[]}