{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"1d3f97a3-fb71-58d0-a690-9d7b6a44bc90","task_key":"test--1d3f97a3-fb71-58d0-a690-9d7b6a44bc90","task_revision_id":"2","upstream_id":"","short_description":"$101$ people, sitting at a round table in any order, had $1,2,... , 101$ cards,…","config":"","split":"test","body":"{\"problem\":\"$101$ people,  sitting at a round table in any order,  had  $1,2,... , 101$ cards,  respectively.  \\nA transfer is someone give  one  card  to one of  the two people  adjacent to him.\\nFind the  smallest positive integer $k$ such that   there always  can  through  no more than  $ k $  times transfer,  each person  hold cards of the same number, regardless of  the sitting order.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}