{"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":"7069a93a-955d-5364-9ab6-0810f92ecdba","task_key":"test--7069a93a-955d-5364-9ab6-0810f92ecdba","task_revision_id":"1","upstream_id":"","short_description":"Mario has a deck of seven pairs of matching number cards and two pairs of…","config":"","split":"test","body":"{\"problem\":\"Mario has a deck of seven pairs of matching number cards and two pairs of matching Jokers, for a total of 18 cards. He shuffles the deck, then draws the cards from the top one by one until he holds a pair of matching Jokers. The expected number of complete pairs that Mario holds at the end (including the Jokers) is $\\\\frac{m}{n}$, where $m, n$ are positive integers and $\\\\operatorname{gcd}(m, n)=1$. Find $100 m+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":[]}