{"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":"5de12c04-b1bf-5d46-a773-0d8e9e5f370f","task_key":"test--5de12c04-b1bf-5d46-a773-0d8e9e5f370f","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be an positive integer. Find the smallest integer $k$ with the following…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \\\\cdots , a_d $ such that $a_1 + a_2 + \\\\cdots + a_d = n$ and $0 \\\\le a_i \\\\le 1$ for $i=1,2,\\\\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.\"}","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":[]}