{"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":"2d43b31d-0cf8-5b27-a9be-6915634f5969","task_key":"test--2d43b31d-0cf8-5b27-a9be-6915634f5969","task_revision_id":"1","upstream_id":"","short_description":"Ali wants to move from point $A$ to point $B$. He cannot walk inside the black…","config":"","split":"test","body":"{\"problem\":\"Ali wants to move from point $A$ to point $B$. He cannot walk inside the black areas but he is free to move in any direction inside the white areas (not only the grid lines but the whole plane). Help Ali to find the shortest path between $A$ and $B$. Only draw the path and write its length.\\n[img]https://1.bp.blogspot.com/-nZrxJLfIAp8/W1RyCdnhl3I/AAAAAAAAIzQ/NM3t5EtJWMcWQS0ig0IghSo54DQUBH5hwCK4BGAYYCw/s1600/igo%2B2016.el1.png[/img]\\nby Morteza Saghafian\"}","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":[]}