{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"humaneval-plus","formal_name":"HumanEval+","introduction":"HumanEval+ keeps the 164 original HumanEval problems and multiplies their tests by roughly 80×. It exists because the original suite was loose enough to pass implementations that were actually wrong.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/evalplus/evalplus","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"37bb6f48-40e5-57ef-9186-38be153c9310","task_key":"default--test--37bb6f48-40e5-57ef-9186-38be153c9310","task_revision_id":"2","upstream_id":"","short_description":"def can_arrange(arr):","config":"default","split":"test","body":"{\"entry_point\":\"can_arrange\",\"prompt\":\"\\ndef can_arrange(arr):\\n    \\\"\\\"\\\"Create a function which returns the largest index of an element which\\n    is not greater than or equal to the element immediately preceding it. If\\n    no such element exists then return -1. The given array will not contain\\n    duplicate values.\\n\\n    Examples:\\n    can_arrange([1,2,4,3,5]) = 3\\n    can_arrange([1,2,3]) = -1\\n    \\\"\\\"\\\"\\n\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/evalplus/evalplus","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}