{"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":"2fe47210-a7a5-5836-8598-e598589bda13","task_key":"default--test--2fe47210-a7a5-5836-8598-e598589bda13","task_revision_id":"2","upstream_id":"","short_description":"def strange_sort_list(lst):","config":"default","split":"test","body":"{\"entry_point\":\"strange_sort_list\",\"prompt\":\"\\ndef strange_sort_list(lst):\\n    '''\\n    Given list of integers, return list in strange order.\\n    Strange sorting, is when you start with the minimum value,\\n    then maximum of the remaining integers, then minimum and so on.\\n\\n    Examples:\\n    strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]\\n    strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]\\n    strange_sort_list([]) == []\\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":[]}