{"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":"8ea8f998-f3c9-59f2-bd7a-3d88388729da","task_key":"default--test--8ea8f998-f3c9-59f2-bd7a-3d88388729da","task_revision_id":"2","upstream_id":"","short_description":"def modp(n: int, p: int):","config":"default","split":"test","body":"{\"entry_point\":\"modp\",\"prompt\":\"\\n\\ndef modp(n: int, p: int):\\n    \\\"\\\"\\\"Return 2^n modulo p (be aware of numerics).\\n    >>> modp(3, 5)\\n    3\\n    >>> modp(1101, 101)\\n    2\\n    >>> modp(0, 101)\\n    1\\n    >>> modp(3, 11)\\n    8\\n    >>> modp(100, 101)\\n    1\\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":[]}