{"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":"7153e555-3fc2-5d62-a80d-c9b1b1c0fd1e","task_key":"test--7153e555-3fc2-5d62-a80d-c9b1b1c0fd1e","task_revision_id":"1","upstream_id":"","short_description":"How many functions $f:\\{1,2, \\ldots, 2013\\} \\rightarrow\\{1,2, \\ldots, 2013\\}$…","config":"","split":"test","body":"{\"problem\":\"How many functions $f:\\\\{1,2, \\\\ldots, 2013\\\\} \\\\rightarrow\\\\{1,2, \\\\ldots, 2013\\\\}$ satisfy $f(j)<f(i)+j-i$ for all integers $i, j$ such that $1 \\\\leq i<j \\\\leq 2013$ ?\"}","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":[]}