{"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":"92a87cf7-f6b2-5910-bd55-74bb48a9ae95","task_key":"default--test--92a87cf7-f6b2-5910-bd55-74bb48a9ae95","task_revision_id":"2","upstream_id":"","short_description":"def words_in_sentence(sentence):","config":"default","split":"test","body":"{\"entry_point\":\"words_in_sentence\",\"prompt\":\"\\ndef words_in_sentence(sentence):\\n    \\\"\\\"\\\"\\n    You are given a string representing a sentence,\\n    the sentence contains some words separated by a space,\\n    and you have to return a string that contains the words from the original sentence,\\n    whose lengths are prime numbers,\\n    the order of the words in the new string should be the same as the original one.\\n\\n    Example 1:\\n        Input: sentence = \\\"This is a test\\\"\\n        Output: \\\"is\\\"\\n\\n    Example 2:\\n        Input: sentence = \\\"lets go for swimming\\\"\\n        Output: \\\"go for\\\"\\n\\n    Constraints:\\n        * 1 <= len(sentence) <= 100\\n        * sentence contains only letters\\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":[]}