{"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":"6a1cf4d3-f377-52ad-9c3a-f9300b1f582d","task_key":"default--test--6a1cf4d3-f377-52ad-9c3a-f9300b1f582d","task_revision_id":"2","upstream_id":"","short_description":"from typing import List","config":"default","split":"test","body":"{\"entry_point\":\"factorize\",\"prompt\":\"from typing import List\\n\\n\\ndef factorize(n: int) -> List[int]:\\n    \\\"\\\"\\\" Return list of prime factors of given integer in the order from smallest to largest.\\n    Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.\\n    Input number should be equal to the product of all factors\\n    >>> factorize(8)\\n    [2, 2, 2]\\n    >>> factorize(25)\\n    [5, 5]\\n    >>> factorize(70)\\n    [2, 5, 7]\\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":[]}