{"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":"1f234d06-07b4-5126-9e12-07dfadb9abff","task_key":"openai~5fhumaneval--test--1f234d06-07b4-5126-9e12-07dfadb9abff","task_revision_id":"1","upstream_id":"","short_description":"def tri(n):","config":"openai_humaneval","split":"test","body":"{\"entry_point\":\"tri\",\"prompt\":\"\\ndef tri(n):\\n    \\\"\\\"\\\"Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in \\n    the last couple centuries. However, what people don't know is Tribonacci sequence.\\n    Tribonacci sequence is defined by the recurrence:\\n    tri(1) = 3\\n    tri(n) = 1 + n / 2, if n is even.\\n    tri(n) =  tri(n - 1) + tri(n - 2) + tri(n + 1), if n is odd.\\n    For example:\\n    tri(2) = 1 + (2 / 2) = 2\\n    tri(4) = 3\\n    tri(3) = tri(2) + tri(1) + tri(4)\\n           = 2 + 3 + 3 = 8 \\n    You are given a non-negative integer number n, you have to a return a list of the \\n    first n + 1 numbers of the Tribonacci sequence.\\n    Examples:\\n    tri(3) = [1, 3, 2, 8]\\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":[]}