{"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":"de6c0f07-6d2d-5080-8ae4-ebeea2bcc18b","task_key":"default--v0~2e1~2e0~5fhf--de6c0f07-6d2d-5080-8ae4-ebeea2bcc18b","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf de6c0f07-6d2d-5080-8ae4-ebeea2bcc18b","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from string import ascii_lowercase\\nimport re\\nfrom collections import Counter\\n# Constants\\nLETTERS_PATTERN = re.compile(r'^(.*?)-[a-z]$')\\nLETTERS = ascii_lowercase\\ndef task_func(string):\\n\",\"complete_prompt\":\"from string import ascii_lowercase\\nimport re\\nfrom collections import Counter\\n\\n# Constants\\nLETTERS_PATTERN = re.compile(r'^(.*?)-[a-z]$')\\nLETTERS = ascii_lowercase\\n\\ndef task_func(string):\\n    \\\"\\\"\\\"\\n    If a string occurs, divide it the last time \\\"-\\\" occurs and count the frequency of each lowercase letter in the prefix of the string.\\n    \\n    Parameters:\\n    - string (str): The input string.\\n\\n    Requirements:\\n    - string\\n    - re\\n    - collections\\n\\n    Returns:\\n    - dict: A dictionary with the frequency of each lowercase letter.\\n\\n    Example:\\n    >>> task_func('abc-def-ghij')\\n    {'a': 1, 'b': 1, 'c': 1, 'd': 1, 'e': 1, 'f': 1, 'g': 0, 'h': 0, 'i': 0, 'j': 0, 'k': 0, 'l': 0, 'm': 0, 'n': 0, 'o': 0, 'p': 0, 'q': 0, 'r': 0, 's': 0, 't': 0, 'u': 0, 'v': 0, 'w': 0, 'x': 0, 'y': 0, 'z': 0}\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"If a string occurs, divide it the last time \\\"-\\\" occurs and count the frequency of each lowercase letter in the prefix of the string.\\nThe function should output with:\\n    dict: A dictionary with the frequency of each lowercase letter.\\nYou should write self-contained code starting with:\\n```\\nfrom string import ascii_lowercase\\nimport re\\nfrom collections import Counter\\n# Constants\\nLETTERS_PATTERN = re.compile(r'^(.*?)-[a-z]$')\\nLETTERS = ascii_lowercase\\ndef task_func(string):\\n```\",\"libs\":\"['collections', 'string', 're']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}