{"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":"b845f598-3405-5a92-b4aa-7b788ee3056a","task_key":"test--b845f598-3405-5a92-b4aa-7b788ee3056a","task_revision_id":"1","upstream_id":"","short_description":"There are 2010 boxes labeled $B_1, B_2, \\dots, B_{2010}$, and $2010n$ balls have…","config":"","split":"test","body":"{\"problem\":\"There are 2010 boxes labeled $B_1, B_2, \\\\dots, B_{2010}$, and $2010n$ balls have been distributed\\namong them, for some positive integer $n$. You may redistribute the balls by a sequence of moves,\\neach of which consists of choosing an $i$ and moving \\\\emph{exactly} $i$ balls from box $B_i$ into any\\none other box. For which values of $n$ is it possible to reach the distribution with exactly $n$ balls\\nin each box, regardless of the initial distribution of balls?\"}","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":[]}