{"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":"82b5d388-9f31-5349-9f15-66381420e783","task_key":"test--82b5d388-9f31-5349-9f15-66381420e783","task_revision_id":"1","upstream_id":"","short_description":"Consider a $9 \\times 9$ grid of squares. Haruki fills each square in this grid…","config":"","split":"test","body":"{\"problem\":\"Consider a $9 \\\\times 9$ grid of squares. Haruki fills each square in this grid with an integer between 1 and 9 , inclusive. The grid is called a super-sudoku if each of the following three conditions hold: - Each column in the grid contains each of the numbers $1,2,3,4,5,6,7,8,9$ exactly once. - Each row in the grid contains each of the numbers $1,2,3,4,5,6,7,8,9$ exactly once. - Each $3 \\\\times 3$ subsquare in the grid contains each of the numbers $1,2,3,4,5,6,7,8,9$ exactly once. How many possible super-sudoku grids are there?\"}","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":[]}