{"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":"4f67cf3d-6dac-5bdc-9ae1-d0066d4aec1a","task_key":"test--4f67cf3d-6dac-5bdc-9ae1-d0066d4aec1a","task_revision_id":"1","upstream_id":"","short_description":"( Elgin Johnston ) Legs $L_1, L_2, L_3, L_4$ of a square table each have length…","config":"","split":"test","body":"{\"problem\":\"( Elgin Johnston ) Legs $L_1, L_2, L_3, L_4$ of a square table each have  length $n$ , where $n$ is a positive integer.  For how many ordered  4-tuples $(k_1, k_2, k_3, k_4)$ of nonnegative integers can we cut  a piece of length $k_i$ from the end of leg $L_i \\\\; (i = 1,2,3,4)$ and still have a stable table?\\n(The table is stable if it can be placed so that  all four of the leg ends touch the floor. Note that a cut leg of length 0 is permitted.)\"}","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":[]}