{"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":"75c77391-d0e7-5a1a-9df9-46ed1b816942","task_key":"test--75c77391-d0e7-5a1a-9df9-46ed1b816942","task_revision_id":"1","upstream_id":"","short_description":"You are the first lucky player to play in a slightly modified episode of Deal or…","config":"","split":"test","body":"{\"problem\":\"You are the first lucky player to play in a slightly modified episode of Deal or No Deal! Initially, there are sixteen cases marked 1 through 16. The dollar amounts in the cases are the powers of 2 from \\\\(2^{1}=2\\\\) to \\\\(2^{16}=65536\\\\), in some random order. The game has eight turns. In each turn, you choose a case and claim it, without opening it. Afterwards, a random remaining case is opened and revealed to you, then removed from the game. At the end of the game, all eight of your cases are revealed and you win all of the money inside them. However, the hosts do not realize you have X-ray vision and can see the amount of money inside each case! What is the expected amount of money you will make, given that you play optimally?\"}","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":[]}