{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"5480d2ab-4b04-566c-b680-6f0633e8b8e2","task_key":"default--v0~2e1~2e0~5fhf--5480d2ab-4b04-566c-b680-6f0633e8b8e2","task_revision_id":"2","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 5480d2ab-4b04-566c-b680-6f0633e8b8e2","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import defaultdict\\nimport itertools\\nimport json\\nimport random\\ndef task_func(LETTERS, n):\\n\",\"complete_prompt\":\"from collections import defaultdict\\nimport itertools\\nimport json\\nimport random\\n\\ndef task_func(LETTERS, n):\\n    \\\"\\\"\\\"\\n    Generates all possible combinations of a given set of letters of length 'n'.\\n    Counts the occurrences of each letter in these combinations and saves the results\\n    in a JSON file. The name of the file is prefix_<random-number-here>.json. The value of\\n    <random-number-here> is between 0 and 100. \\n\\n    Parameters:\\n        LETTERS (list): The list of letters to generate combinations from.\\n        n (int): The length of the combinations.\\n\\n    Returns:\\n        str: The name of the generated JSON file containing letter counts.\\n\\n    Requirements:\\n    - collections.defaultdict\\n    - itertools\\n    - json\\n    - random\\n\\n    Examples:\\n    >>> isinstance(task_func(['a', 'b', 'c', 'd', 'e'], 3), str)\\n    True\\n    >>> 'letter_combinations_' in task_func(['a', 'b', 'c', 'd', 'e'], 2)\\n    True\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Generates all possible combinations of a given set of letters of length 'n'. Counts the occurrences of each letter in these combinations and saves the results in a JSON file. The name of the file is prefix_<random-number-here>.json. The value of <random-number-here> is between 0 and 100.\\nThe function should output with:\\n    str: The name of the generated JSON file containing letter counts.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import defaultdict\\nimport itertools\\nimport json\\nimport random\\ndef task_func(LETTERS, n):\\n```\",\"libs\":\"['collections', 'random', 'itertools', 'json']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}