{"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":"92eb312b-23d2-5d7e-843b-2da94b9c72ea","task_key":"test--92eb312b-23d2-5d7e-843b-2da94b9c72ea","task_revision_id":"1","upstream_id":"","short_description":"While waiting for their food at a restaurant in Harvard Square, Ana and Banana…","config":"","split":"test","body":"{\"problem\":\"While waiting for their food at a restaurant in Harvard Square, Ana and Banana draw 3 squares $\\\\square_{1}, \\\\square_{2}, \\\\square_{3}$ on one of their napkins. Starting with Ana, they take turns filling in the squares with integers from the set $\\\\{1,2,3,4,5\\\\}$ such that no integer is used more than once. Ana's goal is to minimize the minimum value $M$ that the polynomial $a_{1} x^{2}+a_{2} x+a_{3}$ attains over all real $x$, where $a_{1}, a_{2}, a_{3}$ are the integers written in $\\\\square_{1}, \\\\square_{2}, \\\\square_{3}$ respectively. Banana aims to maximize $M$. Assuming both play optimally, compute the final value of $100 a_{1}+10 a_{2}+a_{3}$.\"}","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":[]}