{"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":"57319a10-225d-5cff-b504-9cd9d22e63c8","task_key":"test--57319a10-225d-5cff-b504-9cd9d22e63c8","task_revision_id":"1","upstream_id":"","short_description":"Determine all positive integers \\(k\\) for which there exist a positive integer…","config":"","split":"test","body":"{\"problem\":\"Determine all positive integers \\\\(k\\\\) for which there exist a positive integer \\\\(m\\\\) and a set \\\\(S\\\\) of positive integers such that any integer \\\\(n>m\\\\) can be written as a sum of distinct elements of \\\\(S\\\\) in exactly \\\\(k\\\\) ways.\"}","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":[]}