{"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":"f30dbf6c-8473-58e9-b51e-9d0a6130423a","task_key":"test--f30dbf6c-8473-58e9-b51e-9d0a6130423a","task_revision_id":"1","upstream_id":"","short_description":"Eight points are chosen on the circumference of a circle, labelled $P_{1},…","config":"","split":"test","body":"{\"problem\":\"Eight points are chosen on the circumference of a circle, labelled $P_{1}, P_{2}, \\\\ldots, P_{8}$ in clockwise order. A route is a sequence of at least two points $P_{a_{1}}, P_{a_{2}}, \\\\ldots, P_{a_{n}}$ such that if an ant were to visit these points in their given order, starting at $P_{a_{1}}$ and ending at $P_{a_{n}}$, by following $n-1$ straight line segments (each connecting each $P_{a_{i}}$ and $P_{a_{i+1}}$ ), it would never visit a point twice or cross its own path. Find the number of routes.\"}","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":[]}