{"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":"2fef5dbc-efcc-5e42-8da7-ecb19334d519","task_key":"default--test--2fef5dbc-efcc-5e42-8da7-ecb19334d519","task_revision_id":"2","upstream_id":"","short_description":"def largest_prime_factor(n: int):","config":"default","split":"test","body":"{\"entry_point\":\"largest_prime_factor\",\"prompt\":\"\\n\\ndef largest_prime_factor(n: int):\\n    \\\"\\\"\\\"Return the largest prime factor of n. Assume n > 1 and is not a prime.\\n    >>> largest_prime_factor(13195)\\n    29\\n    >>> largest_prime_factor(2048)\\n    2\\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":[]}