{"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":"76915895-b8b7-5719-aa8d-3a247428c3db","task_key":"test--76915895-b8b7-5719-aa8d-3a247428c3db","task_revision_id":"1","upstream_id":"","short_description":"In $\\triangle A B C, A B=2019, B C=2020$, and $C A=2021$. Yannick draws three…","config":"","split":"test","body":"{\"problem\":\"In $\\\\triangle A B C, A B=2019, B C=2020$, and $C A=2021$. Yannick draws three regular $n$-gons in the plane of $\\\\triangle A B C$ so that each $n$-gon shares a side with a distinct side of $\\\\triangle A B C$ and no two of the $n$-gons overlap. What is the maximum possible value of $n$?\"}","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":[]}