{"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":"5d6e08b5-e814-5563-9569-9b27d9d5adfa","task_key":"openai~5fhumaneval--test--5d6e08b5-e814-5563-9569-9b27d9d5adfa","task_revision_id":"1","upstream_id":"","short_description":"def fibfib(n: int):","config":"openai_humaneval","split":"test","body":"{\"entry_point\":\"fibfib\",\"prompt\":\"\\n\\ndef fibfib(n: int):\\n    \\\"\\\"\\\"The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\\n    fibfib(0) == 0\\n    fibfib(1) == 0\\n    fibfib(2) == 1\\n    fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).\\n    Please write a function to efficiently compute the n-th element of the fibfib number sequence.\\n    >>> fibfib(1)\\n    0\\n    >>> fibfib(5)\\n    4\\n    >>> fibfib(8)\\n    24\\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":[]}