{"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":"e52e205a-a55d-5241-9e89-2852b8539574","task_key":"test--e52e205a-a55d-5241-9e89-2852b8539574","task_revision_id":"1","upstream_id":"","short_description":"Let $A$ be a given set with $n$ elements. Let $k<n$ be a given positive integer.…","config":"","split":"test","body":"{\"problem\":\"Let $A$ be a given set with $n$ elements. Let $k<n$ be a given positive integer. Find the maximum value of $m$ for which it is possible to choose sets $B_i$ and $C_i$ for $i=1,2,\\\\ldots,m$ satisfying the following conditions:\\n[list=1]\\n[*]$B_i\\\\subset A,$ $|B_i|=k,$\\n[*]$C_i\\\\subset B_i$ (there is no additional condition for the number of elements in $C_i$), and\\n[*]$B_i\\\\cap C_j\\\\neq B_j\\\\cap C_i$ for all $i\\\\neq j.$\\n[/list]\"}","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":[]}