{"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":"db9469dc-2f95-5b43-b35c-9ce986773c1e","task_key":"default--test--db9469dc-2f95-5b43-b35c-9ce986773c1e","task_revision_id":"2","upstream_id":"","short_description":"def largest_divisor(n: int) -> int:","config":"default","split":"test","body":"{\"entry_point\":\"largest_divisor\",\"prompt\":\"\\n\\ndef largest_divisor(n: int) -> int:\\n    \\\"\\\"\\\" For a given number n, find the largest number that divides n evenly, smaller than n\\n    >>> largest_divisor(15)\\n    5\\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":[]}