{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"781b2a8b-a039-59a2-95ab-5112e60901c5","task_key":"test--781b2a8b-a039-59a2-95ab-5112e60901c5","task_revision_id":"3","upstream_id":"","short_description":"Let $f:X\\rightarrow X$, where $X=\\{1,2,\\ldots ,100\\}$, be a function satisfying:","config":"","split":"test","body":"{\"problem\":\"Let $f:X\\\\rightarrow X$, where $X=\\\\{1,2,\\\\ldots ,100\\\\}$, be a function satisfying:\\n1) $f(x)\\\\neq x$ for all $x=1,2,\\\\ldots,100$;\\n2) for any subset $A$ of $X$ such that $|A|=40$, we have $A\\\\cap f(A)\\\\neq\\\\emptyset$.\\nFind the minimum $k$ such that for any such function $f$, there exist a subset $B$ of $X$, where $|B|=k$, such that $B\\\\cup f(B)=X$.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}