{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"humaneval","formal_name":"HumanEval","introduction":"HumanEval asks for a Python function body from a docstring and signature, checked by hidden unit tests. It is the original functional-correctness benchmark for code generation.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/openai/openai_humaneval","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"c98c8026-78cb-5014-8c35-798c524eb91f","task_key":"openai~5fhumaneval--test--c98c8026-78cb-5014-8c35-798c524eb91f","task_revision_id":"1","upstream_id":"","short_description":"def largest_divisor(n: int) -> int:","config":"openai_humaneval","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":"text","language":"","answer_status":"unknown","assets":[],"source_url":"https://huggingface.co/datasets/openai/openai_humaneval","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}