{"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":"c07fb5fe-c6d2-55bc-b61e-d5fc7259afd9","task_key":"default--test--c07fb5fe-c6d2-55bc-b61e-d5fc7259afd9","task_revision_id":"2","upstream_id":"","short_description":"def match_parens(lst):","config":"default","split":"test","body":"{\"entry_point\":\"match_parens\",\"prompt\":\"\\ndef match_parens(lst):\\n    '''\\n    You are given a list of two strings, both strings consist of open\\n    parentheses '(' or close parentheses ')' only.\\n    Your job is to check if it is possible to concatenate the two strings in\\n    some order, that the resulting string will be good.\\n    A string S is considered to be good if and only if all parentheses in S\\n    are balanced. For example: the string '(())()' is good, while the string\\n    '())' is not.\\n    Return 'Yes' if there's a way to make a good string, and return 'No' otherwise.\\n\\n    Examples:\\n    match_parens(['()(', ')']) == 'Yes'\\n    match_parens([')', ')']) == 'No'\\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":[]}