{"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":"cf6dc2f5-d313-5a34-a090-23e60fb4be9c","task_key":"default--test--cf6dc2f5-d313-5a34-a090-23e60fb4be9c","task_revision_id":"2","upstream_id":"","short_description":"def is_happy(s):","config":"default","split":"test","body":"{\"entry_point\":\"is_happy\",\"prompt\":\"\\ndef is_happy(s):\\n    \\\"\\\"\\\"You are given a string s.\\n    Your task is to check if the string is happy or not.\\n    A string is happy if its length is at least 3 and every 3 consecutive letters are distinct\\n    For example:\\n    is_happy(a) => False\\n    is_happy(aa) => False\\n    is_happy(abcd) => True\\n    is_happy(aabb) => False\\n    is_happy(adb) => True\\n    is_happy(xyy) => False\\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":[]}