{"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":"771292b2-e788-5126-ac26-3f4c4c467e9c","task_key":"test--771292b2-e788-5126-ac26-3f4c4c467e9c","task_revision_id":"1","upstream_id":"","short_description":"Let $k$ be a positive integer. Lexi has a dictionary $\\mathbb{D}$ consisting of…","config":"","split":"test","body":"{\"problem\":\"Let $k$ be a positive integer. Lexi has a dictionary $\\\\mathbb{D}$ consisting of some $k$-letter strings containing only the letters $A$ and $B$. Lexi would like to write either the letter $A$ or the letter $B$ in each cell of a $k \\\\times k$ grid so that each column contains a string from $\\\\mathbb{D}$ when read from top-to-bottom and each row contains a string from $\\\\mathbb{D}$ when read from left-to-right. \\nWhat is the smallest integer $m$ such that if $\\\\mathbb{D}$ contains at least $m$ different strings, then Lexi can fill her grid in this manner, no matter what strings are in $\\\\mathbb{D}$?\"}","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":[]}