{"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":"d4403b91-864b-57b7-8ca9-53d6aae716ff","task_key":"default--test--d4403b91-864b-57b7-8ca9-53d6aae716ff","task_revision_id":"2","upstream_id":"","short_description":"def anti_shuffle(s):","config":"default","split":"test","body":"{\"entry_point\":\"anti_shuffle\",\"prompt\":\"\\ndef anti_shuffle(s):\\n    \\\"\\\"\\\"\\n    Write a function that takes a string and returns an ordered version of it.\\n    Ordered version of string, is a string where all words (separated by space)\\n    are replaced by a new word where all the characters arranged in\\n    ascending order based on ascii value.\\n    Note: You should keep the order of words and blank spaces in the sentence.\\n\\n    For example:\\n    anti_shuffle('Hi') returns 'Hi'\\n    anti_shuffle('hello') returns 'ehllo'\\n    anti_shuffle('Hello World!!!') returns 'Hello !!!Wdlor'\\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":[]}