{"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":"8f80dcf0-b24c-5ab1-8c98-27a817e7b9d0","task_key":"test--8f80dcf0-b24c-5ab1-8c98-27a817e7b9d0","task_revision_id":"1","upstream_id":"","short_description":"Let $T$ be the set of ordered triples $(x,y,z)$, where $x,y,z$ are integers with…","config":"","split":"test","body":"{\"problem\":\"Let $T$ be the set of ordered triples $(x,y,z)$, where $x,y,z$ are integers with $0\\\\leq x,y,z\\\\leq9$. Players $A$ and $B$ play the following guessing game. Player $A$ chooses a triple $(x,y,z)$ in $T$, and Player $B$ has to discover $A$[i]'s[/i] triple in as few moves as possible.  A [i]move[/i] consists of the following: $B$ gives $A$ a triple $(a,b,c)$ in $T$, and $A$ replies by giving $B$ the number $\\\\left|x+y-a-b\\\\right |+\\\\left|y+z-b-c\\\\right|+\\\\left|z+x-c-a\\\\right|$. Find the minimum number of moves that $B$ needs to be sure of determining $A$[i]'s[/i]  triple.\"}","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":[]}