{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"bigcodebench","formal_name":"BigCodeBench","introduction":"BigCodeBench poses 1,140 function-level tasks drawn across 139 libraries. It tests whether a model can compose several real APIs correctly rather than write one self-contained function.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://bigcode-bench.github.io/","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"8cdf0b4a-1d93-5079-84f9-0f6feac5f89d","task_key":"default--v0~2e1~2e0~5fhf--8cdf0b4a-1d93-5079-84f9-0f6feac5f89d","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 8cdf0b4a-1d93-5079-84f9-0f6feac5f89d","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import Counter\\nimport random\\nfrom itertools import cycle\\n# Constants\\nELEMENTS = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']\\ndef task_func(l):\\n\",\"complete_prompt\":\"from collections import Counter\\nimport random\\nfrom itertools import cycle\\n\\n# Constants\\nELEMENTS = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']\\n\\ndef task_func(l):\\n    \\\"\\\"\\\"\\n    Create a counter from a list \\\"l\\\" and move the first 3 elements to the end of the list.\\n\\n    Parameters:\\n    - l (list): A list of elements that the function will process. \\n\\n    Returns:\\n    - counter (collections.Counter): A frequency counter that maps elements from the input list to their frequencies in the first 30 elements of the cycled, shuffled list. \\n    \\n    Requirements:\\n    - collections\\n    - random\\n    - itertools\\n\\n    Example:\\n    >>> random.seed(42)\\n    >>> task_func(ELEMENTS)\\n    Counter({'I': 3, 'F': 3, 'G': 3, 'J': 3, 'E': 3, 'A': 3, 'B': 3, 'H': 3, 'D': 3, 'C': 3})\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Create a counter from a list \\\"l\\\" and move the first 3 elements to the end of the list.\\nThe function should output with:\\n    counter (collections.Counter): A frequency counter that maps elements from the input list to their frequencies in the first 30 elements of the cycled, shuffled list.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import Counter\\nimport random\\nfrom itertools import cycle\\n# Constants\\nELEMENTS = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J']\\ndef task_func(l):\\n```\",\"libs\":\"['collections', 'itertools', 'random']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}