{"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":"df324152-e512-5d9f-a760-6525a29d8f83","task_key":"default--test--df324152-e512-5d9f-a760-6525a29d8f83","task_revision_id":"2","upstream_id":"","short_description":"def count_up_to(n):","config":"default","split":"test","body":"{\"entry_point\":\"count_up_to\",\"prompt\":\"\\ndef count_up_to(n):\\n    \\\"\\\"\\\"Implement a function that takes an non-negative integer and returns an array of the first n\\n    integers that are prime numbers and less than n.\\n    for example:\\n    count_up_to(5) => [2,3]\\n    count_up_to(11) => [2,3,5,7]\\n    count_up_to(0) => []\\n    count_up_to(20) => [2,3,5,7,11,13,17,19]\\n    count_up_to(1) => []\\n    count_up_to(18) => [2,3,5,7,11,13,17]\\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":[]}