{"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":"9b0e5f94-0973-5636-9881-cfcdf6971ac6","task_key":"test--9b0e5f94-0973-5636-9881-cfcdf6971ac6","task_revision_id":"1","upstream_id":"","short_description":"A convex 2019-gon \\(A_{1}A_{2}\\ldots A_{2019}\\) is cut into smaller pieces along…","config":"","split":"test","body":"{\"problem\":\"A convex 2019-gon \\\\(A_{1}A_{2}\\\\ldots A_{2019}\\\\) is cut into smaller pieces along its 2019 diagonals of the form \\\\(A_{i}A_{i+3}\\\\) for \\\\(1 \\\\leq i \\\\leq 2019\\\\), where \\\\(A_{2020}=A_{1}, A_{2021}=A_{2}\\\\), and \\\\(A_{2022}=A_{3}\\\\). What is the least possible number of resulting pieces?\"}","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":[]}