{"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":"527a02b5-0f1c-5426-9b90-729fac2391b5","task_key":"test--527a02b5-0f1c-5426-9b90-729fac2391b5","task_revision_id":"1","upstream_id":"","short_description":"$100$ children stand in a line each having $100$ candies. In one move, one of…","config":"","split":"test","body":"{\"problem\":\"$100$ children stand in a line each having $100$ candies. In one move, one of them may take some of their candies and distribute them to a non-empty set of the remaining children. After what least number of moves can it happen that no two children have the same number of candies?\"}","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":[]}