{"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":"52c11ec2-f2a0-58ed-a592-55c7af224f51","task_key":"test--52c11ec2-f2a0-58ed-a592-55c7af224f51","task_revision_id":"1","upstream_id":"","short_description":"Find the number of ordered $64$-tuples $(x_0,x_1,\\dots,x_{63})$ such that…","config":"","split":"test","body":"{\"problem\":\"Find the number of ordered $64$-tuples $(x_0,x_1,\\\\dots,x_{63})$ such that $x_0,x_1,\\\\dots,x_{63}$ are distinct elements of $\\\\{1,2,\\\\dots,2017\\\\}$ and \\\\[ x_0 + x_1 + 2x_2 + 3x_3 + \\\\cdots + 63 x_{63} \\\\] is divisible by 2017.\"}","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":[]}