{"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":"8a8cabee-8a5a-55b1-9411-b0e2932cf581","task_key":"test--8a8cabee-8a5a-55b1-9411-b0e2932cf581","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ be a positive integer. A [i]Nordic[/i] square is an $n \\times n$ board…","config":"","split":"test","body":"{\"problem\":\"Let $n$ be a positive integer. A [i]Nordic[/i] square is an $n \\\\times n$ board containing all the integers from $1$ to $n^2$ so that each cell contains exactly one number. Two different cells are considered adjacent if they share a common side. Every cell that is adjacent only to cells containing larger numbers is called a [i]valley[/i]. An [i]uphill path[/i] is a sequence of one or more cells such that:\\n\\n(i) the first cell in the sequence is a valley,\\n\\n(ii) each subsequent cell in the sequence is adjacent to the previous cell, and\\n\\n(iii) the numbers written in the cells in the sequence are in increasing order.\\n\\nFind, as a function of $n$, the smallest possible total number of uphill paths in a Nordic square.\\n\\nAuthor: Nikola Petrovi?\"}","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":[]}