{"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":"ee1a7ce1-e14b-537d-a83f-6b1b95b21b19","task_key":"test--ee1a7ce1-e14b-537d-a83f-6b1b95b21b19","task_revision_id":"1","upstream_id":"","short_description":"In a game, \\(N\\) people are in a room. Each of them simultaneously writes down…","config":"","split":"test","body":"{\"problem\":\"In a game, \\\\(N\\\\) people are in a room. Each of them simultaneously writes down an integer between 0 and 100 inclusive. A person wins the game if their number is exactly two-thirds of the average of all the numbers written down. There can be multiple winners or no winners in this game. Let \\\\(m\\\\) be the maximum possible number such that it is possible to win the game by writing down \\\\(m\\\\). Find the smallest possible value of \\\\(N\\\\) for which it is possible to win the game by writing down \\\\(m\\\\) in a room of \\\\(N\\\\) people.\"}","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":[]}