{"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":"99ad3f9c-623e-5f70-929b-ce5635b997a9","task_key":"default--v0~2e1~2e0~5fhf--99ad3f9c-623e-5f70-929b-ce5635b997a9","task_revision_id":"2","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 99ad3f9c-623e-5f70-929b-ce5635b997a9","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import random\\nimport string\\nfrom collections import Counter\\ndef task_func(num_strings, string_length):\\n\",\"complete_prompt\":\"import random\\nimport string\\nfrom collections import Counter\\n\\ndef task_func(num_strings, string_length):\\n    \\\"\\\"\\\"\\n    Creates a list of random strings, each of a specified length, and counts the frequency\\n    of each character across all strings. The function then returns the characters\\n    and their frequencies sorted by frequency in descending order.\\n    The random strings are composed of ASCII lowercase characters.\\n\\n    Parameters:\\n        num_strings (int): The number of random strings to generate.\\n        string_length (int): The length of each random string.\\n\\n    Requirements:\\n    - random\\n    - string\\n    - collections.Counter\\n\\n    Returns:\\n        list of tuple: A list of tuples where each tuple contains a character and its count,\\n                       sorted by count in descending order.\\n\\n    Examples:\\n    >>> type(task_func(1000, 5)) == list\\n    True\\n    >>> all(isinstance(pair, tuple) and len(pair) == 2 for pair in task_func(1000, 5))\\n    True\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Creates a list of random strings, each of a specified length, and counts the frequency of each character across all strings. The function then returns the characters and their frequencies sorted by frequency in descending order. The random strings are composed of ASCII lowercase characters.\\nThe function should output with:\\n    list of tuple: A list of tuples where each tuple contains a character and its count,\\n    sorted by count in descending order.\\nYou should write self-contained code starting with:\\n```\\nimport random\\nimport string\\nfrom collections import Counter\\ndef task_func(num_strings, string_length):\\n```\",\"libs\":\"['collections', 'random', 'string']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}