{"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":"eda746a4-9f4d-5ef5-9539-1c69af3c80d3","task_key":"test--eda746a4-9f4d-5ef5-9539-1c69af3c80d3","task_revision_id":"1","upstream_id":"","short_description":"The numbers $1,2,\\ldots,64$ are written in the squares of an $8\\times 8$…","config":"","split":"test","body":"{\"problem\":\"The numbers $1,2,\\\\ldots,64$ are written in the squares of an $8\\\\times 8$ chessboard, one number to each square. Then $2\\\\times 2$ tiles are placed on the chessboard (without overlapping) so that each tile covers exactly four squares whose numbers sum to less than $100$. Find, with proof, the maximum number of tiles that can be placed on the chessboard, and give an example of a distribution of the numbers $1,2,\\\\ldots,64$ into the squares of the chessboard that admits this maximum number of tiles.\"}","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":[]}