{"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":"72e6a68c-3217-5340-a7f1-ddbb138d0709","task_key":"default--test--72e6a68c-3217-5340-a7f1-ddbb138d0709","task_revision_id":"2","upstream_id":"","short_description":"def smallest_change(arr):","config":"default","split":"test","body":"{\"entry_point\":\"smallest_change\",\"prompt\":\"\\ndef smallest_change(arr):\\n    \\\"\\\"\\\"\\n    Given an array arr of integers, find the minimum number of elements that\\n    need to be changed to make the array palindromic. A palindromic array is an array that\\n    is read the same backwards and forwards. In one change, you can change one element to any other element.\\n\\n    For example:\\n    smallest_change([1,2,3,5,4,7,9,6]) == 4\\n    smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1\\n    smallest_change([1, 2, 3, 2, 1]) == 0\\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":[]}