{"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":"01d53e9b-f97f-5a49-9536-97b35f0ca002","task_key":"default--v0~2e1~2e0~5fhf--01d53e9b-f97f-5a49-9536-97b35f0ca002","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 01d53e9b-f97f-5a49-9536-97b35f0ca002","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import Counter\\nimport itertools\\nimport random\\n# Constants\\nALPHABET = 'abcdefghijklmnopqrstuvwxyz'\\ndef task_func(list_of_lists, seed=0):\\n\",\"complete_prompt\":\"from collections import Counter\\nimport itertools\\nimport random\\n\\n\\n# Constants\\nALPHABET = 'abcdefghijklmnopqrstuvwxyz'\\n\\ndef task_func(list_of_lists, seed=0):\\n    \\\"\\\"\\\"\\n    Count the frequency of each letter in a list of lists. If a list is empty, \\n    fill it with a random sample from the alphabet, and then count the letters.\\n    \\n    Parameters:\\n    list_of_lists (list): The list of lists.\\n    seed (int): The seed for the random number generator. Defaults to 0.\\n    \\n    Returns:\\n    Counter: A Counter object with the frequency of each letter.\\n    \\n    Requirements:\\n    - collections.Counter\\n    - itertools\\n    - random.sample\\n    \\n    Example:\\n    >>> dict(task_func([['a', 'b', 'c'], [], ['d', 'e', 'f']]))\\n    {'a': 1, 'b': 2, 'c': 1, 'd': 1, 'e': 1, 'f': 1, 'm': 1, 'y': 1, 'n': 1, 'i': 1, 'q': 1, 'p': 1, 'z': 1, 'j': 1, 't': 1}\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Count the frequency of each letter in a list of lists. If a list is empty, fill it with a random sample from the alphabet, and then count the letters.\\nThe function should output with:\\n    Counter: A Counter object with the frequency of each letter.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import Counter\\nimport itertools\\nimport random\\n# Constants\\nALPHABET = 'abcdefghijklmnopqrstuvwxyz'\\ndef task_func(list_of_lists, seed=0):\\n```\",\"libs\":\"['collections', 'random', 'itertools']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}